Deterministic local algorithms, unique identifiers, and fractional graph colouring

DOI10.1016/j.tcs.2014.06.044zbMath1332.68278MaRDI QIDQ896700

Jukka Suomela, Joel Rybicki, Henning Hasemann, Juho Hirvonen

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.044

zbMATH Keywords

distributed algorithms; local algorithms; fractional domatic partition; fractional graph colouring; unique identifiers

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68M14: Distributed systems

68W15: Distributed algorithms

05C72: Fractional graph theory, fuzzy graph theory