Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

DOI10.1007/978-3-642-31104-8_5zbMath1332.68277OpenAlexW2137486523MaRDI QIDQ2913210

Juho Hirvonen, Joel Rybicki, Henning Hasemann, Jukka Suomela

Publication date: 26 September 2012

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10138/37401

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14) Distributed algorithms (68W15) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (2)

Linear-in-\(\varDelta \) lower bounds in the LOCAL model ⋮ Deterministic local algorithms, unique identifiers, and fractional graph colouring

This page was built for publication: Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring