arXiv (All)
open access
Separator Theorem for Minor-Free Graphs in Linear Time
The planar separator theorem by Lipton and Tarjan [FOCS '77, SIAM Journal on Applied Mathematics '79] states that any planar graph with $n$ vertices has a balanced separator of size $O(\sqrt{n})$ that can be found in linear time. This landmark result kicked off decades of research on designing linea
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
- On the Expressive Power of Implicit Line-Graph Higher-Order Weisfeiler--Leman#1110772
- A Complete Characterization of Near Outer-Planar Graphs#938987
- A New Sufficient Condition for Oriented Graphs Determined by Their Generalized Skew Spectra#926349
- Deletion versus alteration in finite structures#490250
- TripleBound: Triplet-Guided Heterogeneous Graph Learning for Microservice Decomposition#998760
Record · ID 986177
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