An asymptotic approximation scheme for multigraph edge coloring

DOI10.1145/1361192.1361198zbMath1445.68176OpenAlexW2159044866MaRDI QIDQ4962714

Peter Sanders, David Steurer

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1361192.1361198

zbMATH Keywords

edge coloringmultigraphschromatic indexdata migration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Graph edge coloring: a survey

This page was built for publication: An asymptotic approximation scheme for multigraph edge coloring