Radiocoloring in planar graphs: Complexity and approximations
From MaRDI portal
Publication:2566036
DOI10.1016/j.tcs.2005.03.013zbMath1077.68072WikidataQ59818713 ScholiaQ59818713MaRDI QIDQ2566036
Dimitris Fotakis, Paul G. Spirakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.013
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Probabilistic methods for algorithmic discrete mathematics
- Zero knowledge and the chromatic number
- Drawing Graphs in the Plane with High Resolution
- Planar Formulae and Their Uses
- A new approach to the minimum cut problem
- Algorithms for Square Roots of Graphs
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item