Go to the corresponding LIPIcs Volume Portal 
Akutsu, Tatsuya ; de la Higuera, Colin ; Tamura, Takeyuki
pdfformat: 

@InProceedings{akutsu_et_al:LIPIcs:2018:8699, author = {Tatsuya Akutsu and Colin de la Higuera and Takeyuki Tamura}, title = {{A Simple LinearTime Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications}}, booktitle = {Annual Symposium on Combinatorial Pattern Matching (CPM 2018)}, pages = {10:110:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770743}, ISSN = {18688969}, year = {2018}, volume = {105}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8699}, doi = {10.4230/LIPIcs.CPM.2018.10}, annote = {Keywords: Plane graph, Graph isomorphism, Maximum common subgraph} }
Keywords:  Plane graph, Graph isomorphism, Maximum common subgraph  
Seminar:  Annual Symposium on Combinatorial Pattern Matching (CPM 2018)  
Issue Date:  2018  
Date of publication:  11.05.2018 