Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks
- 25 December 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 30 (7) , 1672-1686
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- French ANR project DESCARTES
- Franco-Hong Kong ANR-RGC Joint Research Programme (12-IS02-004-02 CO2Dim)
This publication has 20 references indexed in Scilit:
- Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) TimeSIAM Journal on Computing, 2014
- Frugal, acyclic and star colourings of graphsDiscrete Applied Mathematics, 2011
- Node Coloring and Color Conflict Detection in Wireless Sensor NetworksFuture Internet, 2010
- Asymptotically optimal frugal colouringJournal of Combinatorial Theory, Series B, 2010
- Fault-tolerant Agreement in Synchronous Message-passing SystemsSynthesis Lectures on Distributed Computing Theory, 2010
- DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMSParallel Processing Letters, 2004
- A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks2004
- Channel Assignment and Graph Multicoloring2002
- Colouring a graph frugallyCombinatorica, 1997
- Further Results on T-Coloring and Frequency Assignment ProblemsSIAM Journal on Discrete Mathematics, 1994