NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs-Reference-Cited by-同舟云学术

NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs

Published:2000 Issue: Volume: Page:363-372
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fotakis D. A.,Nikoletseas S. E.,Papadopoulou V. G.,Spirakis P. G.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44612-5_32

Reference12 articles.

1. D. Aldous: Random walks in finite groups and rapidly mixing Markov Chains. Seminaire de Probabilites XVII 1981/82 (A. Dold and B. Eckmann, eds), Springer Lecture Notes in Mathematis986 (1982) 243–297.

2. Geir Agnarsson, Magnus M. Hallorsson: Coloring Powers of planar graphs. Symposium of Discrete Algorithms (2000).

3. Alan A. Bertossi and Maurizio A. Bonuccelli: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Networking 3, 4 (Aug.) 1995) 441–449.

4. P. Diaconis: Group representations in probability and statistics. Institute of Mathematical Statistics, Hayward CA, (1988).

5. D. Fotakis, G. Pantziou, G. Pentaris and P. Spirakis: Frequency Assignment in Mobile and Radio Networks. Networks in Distributed Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45 American Mathematical Society (1999) 73–90.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Radiocoloring in Planar Graphs;Encyclopedia of Algorithms;2016

2. On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations;Algorithms, Probability, Networks, and Games;2015

3. Radiocoloring in Planar Graphs;Encyclopedia of Algorithms;2008

4. Generalized Powers of Graphs and Their Algorithmic Use;Algorithm Theory – SWAT 2006;2006

5. Generating and Radiocoloring Families of Perfect Graphs;Experimental and Efficient Algorithms;2005