Arc-Disjoint Paths in Expander Digraphs

DOI10.1137/S0097539701398582MaRDI QIDQ4706195zbMATH OpenOpenAlexWikidataFDO

Authors Tom Bohman, Alan Frieze

Publication date 19 June 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539701398582

zbMATH Keywords

edge disjoint pathsexpander digraphsrandomized algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

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

Cited in

(4)

• Edge-disjoint paths in expander graphs
• Arc-disjoint paths in decomposable digraphs
• Splitting an Expander Graph
• Edge-disjoint paths in expanders: online with removals

This page was built for publication: Arc-Disjoint Paths in Expander Digraphs

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