Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs

DOI10.1017/S0963548300004284zbMath0953.05069OpenAlexW2020270524WikidataQ57401539 ScholiaQ57401539MaRDI QIDQ4500422

Lei Zhao, Alan M. Frieze

Publication date: 23 January 2001

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300004284

zbMATH Keywords

random regular graphsedge-disjoint paths

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Communication Lower Bounds via Critical Block Sensitivity ⋮ Extension Complexity of Independent Set Polytopes

This page was built for publication: Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs