OpenAlex
PricingAboutJobs
Log inGet started
Work

Distance-constraint reachability computation in uncertain graphs

HTML

Year: 2011
Type: article
Source: Proceedings of the VLDB Endowment
DOI: 10.14778/2002938.2002941
Authors: Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang
Institutions: Kent State University, University of Illinois Urbana-Champaign, Microsoft Research Asia (China)
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: uncertain graphs, probabilistic reachability, variance reduction, online approximation, #P-completeness

Open Access status: closed
OpenAlex ID: W2139694815
FWCI: 12.67
Cites: 38
Cited by: 176
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security