An Expansion Tester for Bounded Degree Graphs

DOI10.1007/978-3-540-70575-8_43zbMath1153.68466OpenAlexW1580631876MaRDI QIDQ5900243

Satyen Kale, C. Seshadhri

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Introduction to Testing Graph Properties ⋮ Testing Eulerianity and connectivity in directed sparse graphs ⋮ Every minor-closed property of sparse graphs is testable ⋮ Testing the expansion of a graph ⋮ Tight bounds for the cover time of multiple random walks ⋮ On Testing Expansion in Bounded-Degree Graphs ⋮ Introduction to Testing Graph Properties

This page was built for publication: An Expansion Tester for Bounded Degree Graphs