A Tight Bound for Facial Distance Patterns in Planar Graphs

[2608.07187] A Tight Bound for Facial Distance Patterns in Planar Graphs Skip to main content Search Submit Donate Log in Computer Science > Data Structures and Algorithms arXiv:2608.07187 (cs) [Submitted on 7 Aug 2026 ( v1 ), last revised 12 Oct 2026 (this version, v3)] Title: A Tight Bound for Facial Distance Patterns in Planar Graphs Authors: Viktor Fredslund-Hansen , Shay Mozes , Oren Weimann View PDF HTML (experimental) Abstract: Let $G$ be an undirected unweighted planar graph and let $S=(s_0,\dots,s_{k-1})$ be the vertices of a designated face, listed in cyclic order. Consider a vector that stores the distances from an arbitrary vertex $v$ to all vertices of $S$. The pattern of $v$ is obtained by taking the difference between every pair of consecutive values in this vector. Li and Parter [STOC'19] proved an upper bound of $O(k^3)$ on the number of unique patterns over all vertices of $G$. We improve this to $O(k^2)$, matching a known lower bound and settling a conjecture in [ISAAC'22]. The simple proof was found by OpenAI's GPT 5.6-Sol model. Plugging this new bound into known results has the following three immediate implications for undirected unweighted planar graphs: (1) it gives an improved compression of the Okamura-Seymour metric (2) it improves the space required by constant-time exact distance oracles, and (3) it improves the fastest distributed algorithm for computing the diameter. We further present a previously unknown and nontrivial implication: a (centralized) $\tilde{O}(n^{8/5})$-time algorithm for computing the diameter, improving over the $\tilde{O}(n^{5/3})$ algorithm of [SODA'18] which works for weighted directed planar graphs. Thus, there is currently a gap between the time for computing the diameter between weighted and unweighted planar graphs. Subjects: Data Structures and Algorithms (cs.DS) Cite as: arXiv:2608.07187 [cs.DS] (or arXiv:2608.07187v3 [cs.DS] for this version) https://doi.org/10.48550/arXiv.2608.07187 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Oren Weimann [ view email ] [v1] Fri, 7 Aug 2026 13:04:30 UTC (12 KB) [v2] Thu, 27 Aug 2026 21:31:03 UTC (13 KB) [v3] Mon, 12 Oct 2026 07:12:45 UTC (13 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.DS < prev | next > new | recent | 2026-08 Change to browse by: cs References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

• A Tight Bound for Facial Distance Patterns in Planar Graphs#682797
• Reconocimiento facial por inteligencia artificial: aspectos procesales penales#164477
• Towards the complexity of laugh communication in great apes: exact facial replications in laugh faces of orangutans and chimpanzees.#636
• Triangulating How Things Look#755249
• The origins of face processing in humans: phylogeny and ontogeny#183726