Pages that link to "Item:Q4645182"
From MaRDI portal
The following pages link to Shortest path queries in digraphs of small treewidth (Q4645182):
Displaying 13 items.
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331) (← links)
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms (Q1578402) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Dynamic algorithms for graphs of bounded treewidth (Q4571961) (← links)
- Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (Q4606297) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (Q5055890) (← links)
- Optimal parallel shortest paths in small treewidth digraphs (Q6102289) (← links)
- Shortest beer path queries in outerplanar graphs (Q6103523) (← links)
- Efficient algorithms for shortest path queries in planar digraphs (Q6550542) (← links)
- Shortest path algorithms for nearly acyclic directed graphs (Q6550559) (← links)