Radiocoloring in planar graphs: Complexity and approximations
- 31 August 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 340 (3), 514-538
- https://doi.org/10.1016/j.tcs.2005.03.013
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Frequency assignment in mobile and radio networksPublished by American Mathematical Society (AMS) ,1998
- Zero Knowledge and the Chromatic NumberJournal of Computer and System Sciences, 1998
- Probabilistic Methods for Algorithmic Discrete MathematicsPublished by Springer Nature ,1998
- A new approach to the minimum cut problemJournal of the ACM, 1996
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graphRandom Structures & Algorithms, 1995
- Code assignment for hidden terminal interference avoidance in multihop packet radio networksIEEE/ACM Transactions on Networking, 1995
- Drawing Graphs in the Plane with High ResolutionSIAM Journal on Computing, 1993
- Random walks on finite groups and rapidly mixing markov chainsPublished by Springer Nature ,1983
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980