arXiv (OAI Expanded)
open access
On the Extension Theorem for Packing Steiner Forests
We consider the problem of packing edge-disjoint Steiner forests in a graph. The input consists of a multi-graph $G=(V,E)$ and a collection of $t$ vertex subsets $S = \{S_1,S_2,\ldots,S_t\}$. A Steiner forest for $S$, also called an $S$-forest, is a forest of $G$ in which each $S_i$ is connected. In
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 Extension Theorem for Packing Steiner Forests#819322
- Induced Forest Minor Theorem for Graphs Without an Induced Star#997291
- Connectivity Oracles Under Vertex Failures via a Simple and Fast Low-Degree Steiner Forest Decomposition#924272
- Connectivity Oracles Under Vertex Failures via a Simple and Fast Low-Degree Steiner Forest Decomposition#920041
- The Erd\H os-Sós conjecture in dense graphs#985287
Record · ID 809329
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