Splitting an Expander Graph

DOI10.1006/jagm.1999.1023zbMath0948.05046OpenAlexW2058778915WikidataQ57401545 ScholiaQ57401545MaRDI QIDQ4939611

Alan M. Frieze, Michael S. O. 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

partitionspathsalgorithmsexpandersexpander graph

Mathematics Subject Classification ID

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

Related Items (3)

Graphs, Vectors, and Matrices ⋮ Some remarks on rainbow connectivity ⋮ Line-of-Sight Networks

This page was built for publication: Splitting an Expander Graph