Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Frank Kammer, Dieter Kratsch, and Moritz Laudahn. Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 56:1-56:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kammer_et_al:LIPIcs.MFCS.2016.56,
author = {Kammer, Frank and Kratsch, Dieter and Laudahn, Moritz},
title = {{Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {56:1--56:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.56},
URN = {urn:nbn:de:0030-drops-64683},
doi = {10.4230/LIPIcs.MFCS.2016.56},
annote = {Keywords: graph algorithms, space efficiency, cut vertices, maximal outerplanar graphs}
}
Feedback for Dagstuhl Publishing