Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
From MaRDI portal
Publication:1274331
DOI10.1016/S0304-3975(98)00021-8zbMATH Open0943.68185OpenAlexW2048362350MaRDI QIDQ1274331FDOQ1274331
Shiva Chaudhuri, Christos Zaroliagis
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00021-8
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. I. Excluding a forest
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Parallel algorithms with optimal speedup for bounded treewidth
- Shortest path queries in digraphs of small treewidth
- On-line and dynamic algorithms for shortest path problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Simple Parallel Algorithms for Dynamic Range Products
- Fixed-Parameter Tractability of Treewidth and Pathwidth
- A \(c^k n\) 5-approximation algorithm for treewidth
- Shortest path queries in digraphs of small treewidth
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms
- Query efficient implementation of graphs of bounded clique-width
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
- Improved processor bounds for parallel algorithms for weighted directed graphs
This page was built for publication: Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274331)
