An exact algorithm for the channel assignment problem

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 326-331

  Král, Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECISION THEORY; GRAPH THEORY; NUMBER THEORY; SET THEORY;

CHANNEL ASSIGNMENT; COMPUTATION MODEL; GRAPH LABELING;

PROBLEM SOLVING;

EID: 8344245345     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.020     Document Type: Article

References (16)

1. n): a no-MIS algorithm, in: Proceedings of the FOCS'95, 1995, pp. 444-453. ECCC TR95-033, ftp://ftp.eccc.uni-trier.de/.
2. n). ACM Computing Research Repository cs.DS/0006046, 2000.
3. G. Chartrand, O.R. Oellermann, Applied and Algorithmic Graph Theory, McGraw-Hill, New York, 1993.
4. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring and constraint satisfaction, in: Proceedings of the SODA'01, 2001, pp. 329-337. ACM Computing Research Repository cs.DS/0009006, 2001.
5. D. Eppstein, Small maximum independent sets and faster exact graph coloring, in: Proceedings of the WADS'01, Lecture Notes in Computer Science, vol. 2125, Springer, Berlin, 2001, pp. 462-470. ACM Computing Research Repository cs.DS/0011009, 2001.
6. J. Fiala, T. Kloks, J. Kratochvil, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math. 113 (2001) 59-72.
7. J.R. Griggs, R.K. Yeh, Labelling graphs with a condition at distance 3, SIAM J. Discrete Math. 5 (1992) 586-595.
8. D. Král', An Exact Algorithm for the Channel Assignment Problem, Technical Report, KAM-DIMATIA series 2002-569, 2002.
9. D. Král, R. Škrekovski, A theorem about channel assignment problem, SIAM J. Discrete Math. 16 (3) (2003) 426-437.
10. E.L. Lawler, A note on the complexity of the chromatic number problem, Inform. Process. Lett. 5 (3) (1976) 66-67.
11. C. McDiarmid, Counting and constraint matrices, manuscript, 1998.
12. C. McDiarmid, Discrete mathematics and radio channel assignment, in: C. Linhares-Salas, B. Reed (Eds.), Recent Advances in Theoretical and Applied Discrete Mathematics, Springer, Berlin, 2002.
13. C. McDiarmid, On the span in channel assignment problems: bounds, computing and counting, Discrete Math., to appear.
14. C. McDiarmid, B.A. Reed, Channel assignment on graphs of bounded tree width, Discrete Math., to appear.
15. n) steps, in: Proc. WG'85, Lecture Notes in Computer Science, vol. 790, Springer, Berlin, 1994, pp. 177-182.
16. D.J.A. Welsh, G. Whittle, Arrangements, channel assignments and associated polynomials, Adv. Appl. Math. 23 (1999) 375-406.