OpenAlex
PricingAboutJobs
Log inGet started
Work

Path-tree: An efficient reachability indexing scheme for large directed graphs

HTML

Year: 2011
Type: article
Source: ACM Transactions on Database Systems
DOI: 10.1145/1929934.1929941
Authors: Ruoming Jin, Ning Ruan, Yang Xiang, Haixun Wang
Institutions: Kent State University, The Ohio State University, Microsoft Research Asia (China)
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: reachability queries, graph databases, spanning subgraphs, incremental updates, large-scale graphs

Open Access status: closed

Funder: Division of Information and Intelligent Systems
Award: G167417317
OpenAlex ID: W1968401677
FWCI: 8.119
Cites: 28
Cited by: 90
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