Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
From MaRDI portal
Publication:1351004
DOI10.1016/S0304-3975(96)00065-5zbMath0874.68234OpenAlexW2009248757MaRDI QIDQ1351004
Grammati E. Pantziou, Dimitris J. Kavvadias, Paul G. Spirakis, Christos D. Zaroliagis
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00065-5
Related Items
A Glimpse at Paul G. Spirakis ⋮ The parallel complexity of approximating the high degree subgraph problem ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
Cites Work
- Optimal parallel algorithms on planar graphs
- Matrix multiplication via arithmetic progressions
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Designing networks with compact routing tables
- Parallel computational geometry
- Efficient parallel algorithms for shortest paths in planar digraphs
- Parallel concepts in graph theory
- Searching among intervals and compact routing tables
- The graph genus problem is NP-complete
- A separator theorem for graphs of bounded genus
- Priority Search Trees
- Deterministic coin tossing with applications to optimal parallel list ranking
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Parallel Symmetry-Breaking in Sparse Graphs
- An O(logn) parallel connectivity algorithm
- Planar graph decomposition and all pairs shortest paths
- On-line and dynamic algorithms for shortest path problems
- A simple parallel tree contraction algorithm
- Optimal parallel shortest paths in small treewidth digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
