Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
type: Item
instance of: scholarly article
title: Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
zbMATH Open document ID: 0874.68234
DOI: 10.1016/S0304-3975(96)00065-5
author: Dimitris J. Kavvadias
author: Grammati Pantziou
author: P. G. Spirakis
author: Christos Zaroliagis
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 984230
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: Parallel computational geometry
cites work: Q3056948
cites work: Optimal parallel shortest paths in small treewidth digraphs
cites work: Q3140396
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3619797
cites work: Q3975142
cites work: Q3717092
cites work: Q4036575
cites work: On-line and dynamic algorithms for shortest path problems
cites work: Planar graph decomposition and all pairs shortest paths
cites work: Searching among intervals and compact routing tables
cites work: Designing networks with compact routing tables
cites work: A separator theorem for graphs of bounded genus
cites work: Parallel Symmetry-Breaking in Sparse Graphs
cites work: Q3757929
cites work: Optimal parallel algorithms on planar graphs
cites work: Parallel concepts in graph theory
cites work: Q4023519
cites work: Q4385522
cites work: Q4130999
cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs
cites work: Priority Search Trees
cites work: Q3219753
cites work: Q3670555
cites work: Efficient parallel algorithms for shortest paths in planar digraphs
cites work: An O(logn) parallel connectivity algorithm
cites work: Q3727386
cites work: The graph genus problem is NP-complete
cites work: Q3711761
full work available at URL: s0304-3975(96)00065-5
OpenAlex ID: W2009248757
description: scientific article; zbMATH DE number 984230