Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
From MaRDI portal
Publication:891679
DOI10.1016/J.JCSS.2015.06.008zbMATH Open1343.68072OpenAlexW910816382MaRDI QIDQ891679FDOQ891679
Authors: Fang Wei-Kleiner 
Publication date: 17 November 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.06.008
Recommendations
- Efficient graph reachability query answering using tree decomposition
- scientific article; zbMATH DE number 7561711
- scientific article; zbMATH DE number 1982644
- Succinct representations of weighted trees supporting path queries
- Investigations on Path Indexing for Graph Databases
- Hypertree decompositions and tractable queries
- Shortest path queries in digraphs of small treewidth
- Query evaluation via tree-decompositions
Cites Work
- Shortest-path queries in static networks
- A note on two problems in connexion with graphs
- Emergence of Scaling in Random Networks
- Reachability and Distance Queries via 2-Hop Labels
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Shortest path algorithms: An evaluation using real road networks
- Graph minors. III. Planar tree-width
- Computing the shortest path: \(A^\ast\) search meets graph theory
- Unifying tree decompositions for reasoning in graphical models
- Point-to-Point Shortest Path Algorithms with Preprocessing
- Planar graph decomposition and all pairs shortest paths
Cited In (3)
Uses Software
This page was built for publication: Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891679)
