@InProceedings{akutsu_et_al:LIPIcs.CPM.2018.10,
author = {Akutsu, Tatsuya and de la Higuera, Colin and Tamura, Takeyuki},
title = {{A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {10:1--10:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.10},
URN = {urn:nbn:de:0030-drops-86992},
doi = {10.4230/LIPIcs.CPM.2018.10},
annote = {Keywords: Plane graph, Graph isomorphism, Maximum common subgraph}
}