An experimental study of a simple, distributed edge-coloring algorithm

DOI10.1145/1005813.1041515MaRDI QIDQ5463446zbMATH OpenOpenAlexFDO

Authors Alessandro Panconesi, Larry D. Jun. Risinger, Madhav V. Marathe

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmsschedulinghigh performance computingexperimental analysis of algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 2119716
• An experimental analysis of simple, distributed vertex coloring algorithms
• Nearly optimal distributed edge coloring in O(log log n) rounds
• Fast randomized algorithms for distributed edge coloring (extended abstract)
• Simple distributed +1-coloring of graphs

Cited in

(9)

• scientific article; zbMATH DE number 6850477 (Why is no real title available?)
• Distributed deterministic edge coloring using bounded neighborhood independence
• scientific article; zbMATH DE number 2083800 (Why is no real title available?)
• Link scheduling in wireless sensor networks: distributed edge-coloring revisited
• A simple and fast heuristic algorithm for edge-coloring of graphs
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
• scientific article; zbMATH DE number 2119716 (Why is no real title available?)
• An experimental analysis of simple, distributed vertex coloring algorithms
• Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces

This page was built for publication: An experimental study of a simple, distributed edge-coloring algorithm

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