arXiv (All)
open access
Dynamic Edge Coloring of Forests
In the \emph{dynamic edge coloring} problem, one has to maintain a graph of maximum degree $Δ$ with at most $Δ+c$ colors, under edge updates. A prominent objective is to minimize the \emph{recourse}, namely the number of edges that are recolored. We study this problem on forests, arguably the simple
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
- Dynamic Edge Coloring of Forests#783570
- Visualizing Treewidth#798636
- Visualizing Treewidth#797223
- Recursive Paintboxes and the Martin Boundary of the Hoffman Rooted-Tree Graph#1078206
- Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees#706223
Record · ID 785160
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