Parallel approximate edge coloring revisited

MaRDI QIDQ4250737zbMATH OpenFDO

Authors W. Liang, George Havas, Anne Penfold Street

Publication date 10 November 1999

zbMATH Keywords

parallel algorithm for edge coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Very fast parallel algorithms for approximate edge coloring
• Efficient parallel algorithms for edge coloring problems
• Parallel algorithms for the edge-coloring and edge-coloring update problems

Cited in

(9)

• Parallel concepts in graph theory
• Parsimonious edge coloring
• Parallel algorithms for the edge-coloring and edge-coloring update problems
• scientific article; zbMATH DE number 3935077 (Why is no real title available?)
• Efficient parallel algorithms for edge coloring problems
• An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs
• scientific article; zbMATH DE number 2090688 (Why is no real title available?)
• Dynamic Edge Coloring with Improved Approximation
• Very fast parallel algorithms for approximate edge coloring

This page was built for publication: Parallel approximate edge coloring revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250737)