arXiv (All)
open access
Paths and Intersections: Repelling Pairs
We study two inverse problems for shortest-path metrics of Okamura-Seymour instances: recognizing metrics realizable by outerplanar graphs, and computing minimum-edge Okamura-Seymour realizations. We introduce the notion of \emph{repelling pairs}, a metric certificate that the shortest paths corresp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An involution on Dyck paths in the region $\defc\le\min(\area,\dinv)$ that interchanges area and dinv#1035807
- Width-Bounded Equational Derivations for Finite Graph Expressions#985689
- Analytical solution of traversable wormholes in the presence of positive cosmological constant#1069798
- Semi-Synchronous Exploration in Dynamic Graphs#187287
- Dynamics on graphs with disjoint cycles and applications#615135
Record · ID 997514
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive