@inproceedings{b3f81e0f7a3e4871a11c82a1a30c2191,
title = "The weighted barycenter drawing recognition problem",
abstract = "We consider the question of whether a given graph drawing Γ of a triconnected planar graph G is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of Γ. This leads to positive answers when the graph is a Halin graph, and to a polynomial time recognition algorithm when the graph is cubic.",
author = "Peter Eades and Patrick Healy and Nikolov, {Nikola S.}",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 26th International Symposium on Graph Drawing and Network Visualization, GD 2018 ; Conference date: 26-09-2018 Through 28-09-2018",
year = "2018",
doi = "10.1007/978-3-030-04414-5_40",
language = "English",
isbn = "9783030044138",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "569--575",
editor = "Therese Biedl and Andreas Kerren",
booktitle = "Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings",
}