Fast algorithms for Vizing's theorem on bounded degree graphs

Vizing's theorem states that every graph G of maximum degree Δ can be properly edge-colored using Δ+1 colors. The fastest currently known (Δ+1)-edge-coloring algorithm for general graphs is due to Sinnamon and runs in time O(mn), where n≔|V(G)| and m≔|E(G)|. We investigate the case when Δ is co...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of combinatorial theory. Series B Ročník 175; s. 69 - 125
Hlavní autoři:	Bernshteyn, Anton, Dhawan, Abhishek
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.11.2025
Témata:	[formula omitted] model Distributed algorithm Edge-coloring Linear-time algorithm Vizing's theorem Edge-coloring LOCAL model Vizing's theorem Distributed algorithm Linear-time algorithm
ISSN:	0095-8956
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!