Efficient graph reachability query answering using tree decomposition

DOI10.1007/978-3-642-15349-5_13MaRDI QIDQ3584970zbMATH OpenOpenAlexFDO

Authors Fang Wei

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15349-5_13

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
• PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies
• A solution for regular query evaluation on XML data

Cited in

(3)

• Reachability in big graphs: a distributed indexing and querying approach
• O'Reach: Even Faster Reachability in Large Graphs
• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs

This page was built for publication: Efficient graph reachability query answering using tree decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584970)