Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks
- 1 January 2002
- journal article
- Published by Springer Nature in Wireless Networks
- Vol. 8 (1) , 49-60
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Every Planar Graph Is 5-ChoosableJournal of Combinatorial Theory, Series B, 1994
- A self-stabilizing algorithm for coloring planar graphsDistributed Computing, 1993
- List colourings of planar graphsDiscrete Mathematics, 1993
- Performance issues and algorithms for dynamic channel assignmentIEEE Journal on Selected Areas in Communications, 1993
- Impact of mobility on distributed computationsACM SIGOPS Operating Systems Review, 1993
- Colorings and orientations of graphsCombinatorica, 1992
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 1992
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Network decomposition and locality in distributed computation1989
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984