Pages that link to "Item:Q1578402"
From MaRDI portal
The following pages link to Shortest paths in digraphs of small treewidth. I: Sequential algorithms (Q1578402):
Displaying 24 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Shortest path algorithms for nearly acyclic directed graphs (Q1274325) (← links)
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Bundling all shortest paths (Q2306586) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Q2828317) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Simple Parallel Algorithms for Dynamic Range Products (Q3464484) (← links)
- Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs (Q4606297) (← links)
- Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (Q5055890) (← links)
- (Q5092347) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- (Q5743390) (← links)
- Optimal parallel shortest paths in small treewidth digraphs (Q6102289) (← links)
