REVIEW
The Weighted Barycenter Drawing Recognition Problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Weighted Barycenter Drawing Recognition Problem
classification
cs.CG
keywords
graphdrawingbarycentergammaquestionrecognitionweightedwhen
read the original 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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.