Deutsche Nationalbibliothek
metadata only
Finding Maximum-Success Disjoint Paths / Aaron Neugebauer, Marie Schmidt
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 extrema of the mean subtree order of graphs#1013436
- Optimal impartial correspondences#367001
- An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets#1051123
- The Area Asymptotics of $(sn,n)$-Dyck Paths#1217046
- Consistent Path Selection for Bi-objective Median Location Problems on Graphs#625121
Record · ID 1188480
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