Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

Fabian Kuhn
We are given a set $V$ of autonomous agents (e.g.\ the computers of a distributed system) that are connected to each other by a graph $G=(V,E)$ (e.g.\ by a communication network connecting the agents). Assume that all agents have a unique ID between $1$ and $N$ for a parameter $N\ge|V|$ and that each agent knows its ID as well as the IDs of its neighbors in $G$. Based on this limited information, every agent $v$...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.