Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks

DOI10.1023/A:1012719525108zbMath1012.68951OpenAlexW1844250973WikidataQ57583991 ScholiaQ57583991MaRDI QIDQ1859453

Philippas Tsigas, Marina Papatriantafilou, Naveen Garg

Publication date: 19 February 2003

Published in: Wireless Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012719525108

zbMATH Keywords

cellular networksdistributed frequency allocationdynamic frequency allocationfailure localityrequest satisfiability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Related Items (2)

A note on the minimum number of choosability of planar graphs ⋮ List edge and list total coloring of planar graphs with maximum degree 8

This page was built for publication: Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks