Euro-Par 2004 Parallel Processing

DOI10.1007/b99409zbMath1096.68780OpenAlexW2477312825MaRDI QIDQ5311346

Adam Nadolski, Jennie C. Hansen, Łukasz Kuszner, Marek Kubale

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99409

Mathematics Subject Classification ID

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

Related Items (3)

Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge ⋮ Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks

This page was built for publication: Euro-Par 2004 Parallel Processing