Constructing disjoint paths on expander graphs

DOI10.1007/BF02125897MaRDI QIDQ1262782zbMATH OpenFDO

Authors David Peleg, Eli Upfal

Publication date 1989

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02125897

zbMATH Keywords

complexityDeterministic-\({\mathcal P}\)disjoint pathsexpander interconnection graphsinterconnection networkparallel algorithmsparallel-distributed model of computationRandom-\({\mathcal N}{\mathcal C}\)

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• scientific article; zbMATH DE number 871922
• Edge-disjoint paths in expander graphs
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• scientific article; zbMATH DE number 1445370

Cites work

• A Scheme for Fast Parallel Communication
• Constructing a perfect matching is in random NC
• Eigenvalues and expanders
• Expanding graphs contain all small trees
• Graph minors. VI. Disjoint paths across a disc
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matching is as easy as matrix inversion
• Parallel hashing
• The Token Distribution Problem

Cited in

(15)

• Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
• Approximations for the disjoint paths problem in high-diameter planar networks
• Multi-processor scheduling and expanders
• The electrical resistance of a graph captures its commute and cover times
• On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
• scientific article; zbMATH DE number 3883622 (Why is no real title available?)
• Expander graphs and their applications
• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• scientific article; zbMATH DE number 1559568 (Why is no real title available?)
• Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing
• scientific article; zbMATH DE number 1445370 (Why is no real title available?)
• Shortest edge-disjoint paths in graphs
• Edge-disjoint paths in expanders: online with removals
• The cover time of a regular expander is O(n log n)
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms

This page was built for publication: Constructing disjoint paths on expander graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262782)