Efficient Graph Reachability Query Answering Using Tree Decomposition

DOI10.1007/978-3-642-15349-5_13zbMATH Open1287.68038OpenAlexW1606677329MaRDI QIDQ3584970

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)

Related Items (2)

Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs ⋮ O'Reach: Even Faster Reachability in Large 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)