arXiv (All)
open access
Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs
We show that, on bipartite $n$-vertex graphs in the LOCAL model of distributed computation, $(Δ+ 1)$-edge coloring can be solved deterministically in $O(f(Δ) \log n)$ rounds for some function $f$. In particular this implies a deterministic $O(\log n)$-round upper bound for $(Δ+ 1)$-edge coloring o
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
- Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs#1375009
- Distributed $(Δ+1)$-Coloring in $O(\sqrtΔ+\log^* n)$ Rounds#1328165
- Distributed $(Δ+1)$-Coloring in $O(\sqrtΔ+\log^* n)$ Rounds#1318985
- Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling#1117362
- Almost Lossless Transfer for Cuttable Distributed Problems#1326846
Record · ID 1386662
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