Distributed balanced color assignment on arbitrary networks

DOI10.1016/J.TCS.2019.12.023MaRDI QIDQ2290638zbMATH OpenOpenAlexWikidataFDO

Authors Gianluca De Marco, Mauro Leoncini, Manuela Montangero

Publication date 29 January 2020

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

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

zbMATH Keywords

distributed computingassignment problemsdistributed algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Distributed algorithms (68W15) Discrete location and assignment (90B80)

Recommendations

• Locally optimal load balancing
• Distributed Selfish Load Balancing
• Perfectly balanced allocation
• On the complexity of distributed graph coloring
• The communication complexity of distributed task allocation

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A new distributed algorithm to find breadth first search trees
• Distributed Computing: A Locality-Sensitive Approach
• Distributed balanced color assignment on arbitrary networks
• Network flows. Theory, algorithms, and applications.
• The -assignment problems

Cited in

(2)

• scientific article; zbMATH DE number 1750105 (Why is no real title available?)
• Distributed balanced color assignment on arbitrary networks

This page was built for publication: Distributed balanced color assignment on arbitrary networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290638)