Distributed Computing with Advice: Information Sensitivity of Graph Coloring
From MaRDI portal
Publication:5428812
DOI10.1007/978-3-540-73420-8_22zbMath1171.68859OpenAlexW1502033971MaRDI QIDQ5428812
Pierre Fraigniaud, Andrzej Pelc, Cyril Gavoille, David Ilcinkas
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_22
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)
Related Items (11)
Node labels in local decision ⋮ Exact Bounds for Distributed Graph Colouring ⋮ Measuring the problem-relevant information in input ⋮ Large cuts with local algorithms on triangle-free graphs ⋮ Fast Radio Broadcasting with Advice ⋮ Local Maps: New Insights into Mobile Agent Algorithms ⋮ Tree exploration with advice ⋮ Fast radio broadcasting with advice ⋮ Online computation with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Graph searching with advice
This page was built for publication: Distributed Computing with Advice: Information Sensitivity of Graph Coloring
