Connectivity Oracles for Planar Graphs

Glencora Borradaile; Seth Pettie; Christian Wulff-Nilsen

doi:10.1007/978-3-642-31155-0_28

Connectivity Oracles for Planar Graphs

Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

8 Citations (Scopus)

Original language	English
Title of host publication	Algorithm Theory – SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings
Editors	Fedor V. Fomin, Petteri Kaski
Number of pages	12
Publisher	Springer
Publication date	2012
Pages	316-327
ISBN (Print)	978-3-642-31154-3
ISBN (Electronic)	978-3-642-31155-0
DOIs	https://doi.org/10.1007/978-3-642-31155-0_28
Publication status	Published - 2012
Externally published	Yes
Event	13th Scandinavian Symposium and Workshops on Algorithm Theory - Helsinki, Finland Duration: 4 Jul 2012 → 6 Jul 2012 Conference number: 13

Conference

Conference	13th Scandinavian Symposium and Workshops on Algorithm Theory
Number	13
Country/Territory	Finland
City	Helsinki
Period	04/07/2012 → 06/07/2012

Series	Lecture notes in computer science
Volume	7357
ISSN	0302-9743

Access to Document

10.1007/978-3-642-31155-0_28

http://dx.doi.org/10.1007/978-3-642-31155-0_28

Cite this

Connectivity Oracles for Planar Graphs. / Borradaile, Glencora; Pettie, Seth; Wulff-Nilsen, Christian.

Algorithm Theory – SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. ed. / Fedor V. Fomin; Petteri Kaski. Springer, 2012. p. 316-327 (Lecture notes in computer science, Vol. 7357).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Borradaile, G, Pettie, S & Wulff-Nilsen, C 2012, Connectivity Oracles for Planar Graphs. in FV Fomin & P Kaski (eds), Algorithm Theory – SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Springer, Lecture notes in computer science, vol. 7357, pp. 316-327, 13th Scandinavian Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 04/07/2012. https://doi.org/10.1007/978-3-642-31155-0_28

@inproceedings{8203d6607e33451fa1598d5b40ba110d,

title = "Connectivity Oracles for Planar Graphs",

author = "Glencora Borradaile and Seth Pettie and Christian Wulff-Nilsen",

year = "2012",

doi = "10.1007/978-3-642-31155-0_28",

language = "English",

isbn = "978-3-642-31154-3",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "316--327",

editor = "Fomin, {Fedor V.} and Petteri Kaski",

booktitle = "Algorithm Theory – SWAT 2012",

address = "Switzerland",

note = "null ; Conference date: 04-07-2012 Through 06-07-2012",

}

TY - GEN

T1 - Connectivity Oracles for Planar Graphs

AU - Borradaile, Glencora

AU - Pettie, Seth

AU - Wulff-Nilsen, Christian

N1 - Conference code: 13

PY - 2012

Y1 - 2012

U2 - 10.1007/978-3-642-31155-0_28

DO - 10.1007/978-3-642-31155-0_28

M3 - Article in proceedings

SN - 978-3-642-31154-3

T3 - Lecture notes in computer science

SP - 316

EP - 327

BT - Algorithm Theory – SWAT 2012

A2 - Fomin, Fedor V.

A2 - Kaski, Petteri

PB - Springer

Y2 - 4 July 2012 through 6 July 2012

ER -