Shortest beer path queries in digraphs with bounded treewidth
From MaRDI portal
Cites work
- A linear time algorithm for finding tree-decompositions of small treewidth
- A single-exponential time 2-approximation algorithm for treewidth
- Algorithms – ESA 2004
- Almost optimal distance oracles for planar graphs
- An inverse-Ackermann type lower bound for online minimum spanning tree verification
- Approximate distance oracles
- Computing on a free tree via complexity-preserving mappings
- Efficient algorithms for shortest path queries in planar digraphs
- Exact distance oracles for planar graphs
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast and compact exact distance oracle for planar graphs
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 7788487 (Why is no real title available?)
- scientific article; zbMATH DE number 7788598 (Why is no real title available?)
- scientific article; zbMATH DE number 7788635 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Shortest beer path queries based on graph decomposition
- Shortest path queries in planar graphs
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms
- Subcubic equivalences between path, matrix and triangle problems
Cited in
(3)
This page was built for publication: Shortest beer path queries in digraphs with bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953184)
