The Weighted Barycenter Drawing Recognition Problem

09/03/2018

∙

by   Peter Eades, et al.

∙

0

∙

share

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.