Name
Abstract | ||
|---|---|---|
We consider the question of whether a given graph drawing Gamma of a triconnected planar graph G is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of Gamma. This leads to positive answers when the graph is a Halin graph, and to a polynomial time recognition algorithm when the graph is cubic. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-04414-5_40 | GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018 |
DocType | Volume | ISSN |
Conference | 11282 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Eades | 1 | 1122 | 103.72 |
| Patrick Healy | 2 | 21 | 2.63 |
| Nikola S. Nikolov | 3 | 137 | 18.59 |