Finding Small Sparse Cuts by Random Walk

DOI10.1007/978-3-642-32512-0_52zbMath1372.05221arXiv1204.4666OpenAlexW42929123MaRDI QIDQ3167431

Lap Chi Lau, Tsz Chiu Kwok

Publication date: 2 November 2012

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4666

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Random walks on graphs (05C81)

Related Items (1)

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

This page was built for publication: Finding Small Sparse Cuts by Random Walk