Outerplanar metrics admit an O(k^5) recognition algorithm but no O(1)-point local characterization, proved via a repelling-paths condition on shortest-path structures.
arXiv preprint arXiv:2507.09620 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Paths and Intersections: Recognizing Outerplanar Metrics
Outerplanar metrics admit an O(k^5) recognition algorithm but no O(1)-point local characterization, proved via a repelling-paths condition on shortest-path structures.