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

From MaRDI portal

Revision as of 11:03, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5463446

Jump to:navigation, search

DOI10.1145/1005813.1041515zbMath1078.05527OpenAlexW2081776945MaRDI QIDQ5463446

Larry D. Jun. Risinger, Alessandro Panconesi, 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

scheduling high performance computing randomized algorithms experimental analysis of algorithms

Mathematics Subject Classification ID

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

Related Items (2)

A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems ⋮ Link scheduling in wireless sensor networks: distributed edge-coloring revisited

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5463446&oldid=20244530"