Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
- 28 August 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 203 (2) , 205-223
- https://doi.org/10.1016/s0304-3975(98)00021-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Zum Hilbertschen Aufbau der reellen ZahlenMathematische Annalen, 1928