Constructing disjoint paths on expander graphs
type: Item
instance of: scholarly article
title: Constructing disjoint paths on expander graphs
zbMATH Open document ID: 0686.68056
DOI: 10.1007/BF02125897
published in: Combinatorica
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4125030
zbMATH Keywords: interconnection network
zbMATH Keywords: complexity
zbMATH Keywords: disjoint paths
zbMATH Keywords: expander interconnection graphs
zbMATH Keywords: Deterministic-\({\mathcal P}\)
zbMATH Keywords: Random-\({\mathcal N}{\mathcal C}\)
zbMATH Keywords: parallel-distributed model of computation
zbMATH Keywords: parallel algorithms
author: David Peleg
author: Eli Upfal
MaRDI profile type: Publication
cites work: Eigenvalues and expanders
cites work: Expanding graphs contain all small trees
cites work: Q4198056
cites work: Parallel hashing
cites work: Constructing a perfect matching is in random NC
cites work: Q3048571
cites work: Matching is as easy as matrix inversion
cites work: The Token Distribution Problem
cites work: Graph minors. VI. Disjoint paths across a disc
cites work: A Scheme for Fast Parallel Communication
description: scientific article; zbMATH DE number 4125030