Maximum clique transversals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2204, Issue , 2001, Pages 32-43

  Chang, Maw Shang ^a   Kloks, Ton ^b   Lee, Chuan Min ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS;

ALGORITHMIC ASPECTS; APPROXIMATION RESULTS; CHORDAL GRAPHS; CLIQUE NUMBER; COMPARABILITY GRAPHS; DISTANCE-HEREDITARY GRAPHS; MAXIMUM CLIQUE; STRONGLY CHORDAL GRAPH;

TREES (MATHEMATICS);

EID: 77249118352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_5     Document Type: Conference Paper

References (18)

1. Alber, J., H. Bodlaender, H. Femau, and R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems. Lecture Notes in Computer Science 1851, (2000), pp. 97-110. Proceedings SWAT’00.
2. 4‘s, Discrete Applied Mathematics 84, (1998), pp. 1-13.
3. Babel, L., T. Kloks, J. Kratochvíl, H. Müller, and S. Olariu, Algorithms for graphs with few P4‘s. To appear.
4. Baker, B. S., Approximation algorithms for NP-complete problems on planar graphs, Journal of the Association for Computing Machinery 41, (1994), pp. 153-180.
5. Balachandran, V., P. Nagavamsi, and C. P. Rangan, Clique transversal and clique independence on comparability graphs, Information processing letters 58, (1996), pp. 181-184.
6. Brandstädt, A., V. B. Le, and J. P. Spinrad, Graph classes-A Survey, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
7. Cai, Y. and M. C. Kong, Generating all maximal cliques and related problems for certain perfect graphs. Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992). Congr. Numer. 90 (1992), pp. 33-55.
8. M.-S. Chang, Y.-H. Chen, G. J. Chang, and J. H. Yan, Algorithmic aspects of the generalised clique transversal problem on chordal graphs, Discrete Applied Mathematics 66, (1996), pp. 189-203.
9. M.-S. Chang, S.-Y. Hsieh, and G.-H. Chen, Dynamic programming on distance hereditary graphs. Lecture Notes in Computer Science 1350, (1997), pp 344-353.
10. Chrobak, M. and D. Eppstein, Planar orientations with low out-degree and Compaction of adjacency Matrices. Theoretical Computer Science 86, (1991), pp 243-266.
11. Corneil, D. G. and J. M. Keil, A dynamic programming approach to the domination set problem on fc-trees, SIAM J. Algebraic and Discrete Methods 8, (1987), pp. 535-543.
12. Even, S., Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
13. Garey, M. R., and D. S. Johnson, Computers and intractability-A guide to the theory of NP-completeness, W. H. Freeman and company, New York, 1999.
14. Guruswami, V. and C. P. Rangan, Algorithmic aspects of clique transversal and clique-independent sets, Discrete Applied Mathematics 100, (2000), pp. 183-202.
15. Itai, A. and M. Rodeh, Finding a minimum circuit in a graph, SIAM Journal on Computing 7, (1978), pp. 413-423.
16. Redei, L., Ein Konbinatorischer, Acta Litt. Szeged, 7, pp. 39-43, 1934.
17. Uehara, R., NP-complete problems on a 3-connected cubic planar graph and their applications, Technical Report TWCU-M-0004, Tokyo Woman’s Christian University, 1996 http://www.komazawa-u.ac.jp/uehara/ps/triangle.ps.gz
18. Papadimitriou, C. and M. Yannakakis, The clique problem for planar graphs, Information Processing Letters, 13, (1981), pp. 131-133.