Splitting an Expander Graph

DOI10.1006/JAGM.1999.1023MaRDI QIDQ4939611zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alan Frieze, Michael Molloy

Publication date 7 November 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1807/9471

zbMATH Keywords

algorithmsexpander graphexpanderspartitionspaths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Programming involving graphs or networks (90C35)

Recommendations

• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• Arc-Disjoint Paths in Expander Digraphs
• Edge-disjoint paths in expander graphs
• A fast randomized algorithm for partitioning a graph into paths of fixed length
• scientific article; zbMATH DE number 1445370

Cited in

(12)

• Recursive construction for 3-regular expanders
• Remarks on partitions into expanders
• Partition expanders
• Edge-disjoint paths in expander graphs
• Partition expanders
• Graphs, vectors, and matrices
• Line-of-Sight Networks
• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• Arc-Disjoint Paths in Expander Digraphs
• Finding a bounded-degree expander inside a dense one
• scientific article; zbMATH DE number 5194482 (Why is no real title available?)
• Weaver's discrepancy for Gaussian random vectors

This page was built for publication: Splitting an Expander Graph

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