Planar Graphs: Random Walks and Bipartiteness Testing

DOI10.1109/FOCS.2011.69zbMath1292.68123MaRDI QIDQ5494981

Krzysztof Onak, Christian Sohler, Morteza Monemizadeh, Artur Czumaj

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Random walks on graphs (05C81)

Related Items (3)

Unnamed Item ⋮ Dynamic graph stream algorithms in \(o(n)\) space ⋮ Unnamed Item

This page was built for publication: Planar Graphs: Random Walks and Bipartiteness Testing