Connectivity Oracles for Planar Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen. Connectivity Oracles for Planar Graphs. In Fedor V. Fomin, Petteri Kaski, editors, Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Volume 7357 of Lecture Notes in Computer Science, pages 316-327, Springer, 2012. [doi]

The following publications are possibly variants of this publication:

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing TimeGlencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen. focs 2010: 601-610 [doi]

The Two-Edge Connectivity Survivable Network Problem in Planar GraphsGlencora Borradaile, Philip N. Klein. icalp 2008: 485-501 [doi]

runs on WebDSL