HAL (France)
open access
Algorithms for packing and covering problems
This thesis studies various problems surrounding packings and coverings in graph theory and gives algorithms to solve them. We first take a look at packings of arborescences, a field of study initiated by Edmonds in 1960 which aims to pack as many arc-disjoint arborescences as possible in a directed
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 Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem#1049199
- On $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs#793984
- On $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs#789965
- Approximation Algorithms for Perfect Fair-Triangle Packing#652430
- Approximation Algorithms for Perfect Fair-Triangle Packing#650977
Record · ID 818515
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