加权重心图形识别问题
The Weighted Barycenter Drawing Recognition Problem
摘要：
本文考虑了三连通平面图$G$的给定图图$Γ$是否为加权重心图的问题。我们用$Γ$的脸用一个优雅的算术特征来回答这个问题。当图是Halin图时，这导致肯定的答案，并且当图是立方时，导致多项式时间识别算法。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
