An experimental analysis of simple, distributed vertex coloring algorithms

DOI10.1007/s00453-004-1104-3zbMath1082.68081OpenAlexW3138653749MaRDI QIDQ1763143

Riccardo Silvestri, Irene Finocchi, Alessandro Panconesi

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1104-3

zbMATH Keywords

Algorithm engineeringDistributed graph algorithmsVertex coloring

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) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (3)

A framework for scalable greedy coloring on distributed-memory parallel computers ⋮ Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge ⋮ The maximum happy induced subgraph problem: bounds and algorithms

This page was built for publication: An experimental analysis of simple, distributed vertex coloring algorithms