Independent sets with domination constraints

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 39-54

  Halldórsson, Magnús M ^a   Kratochvíl, Jan ^b   Telle, Jan Arne ^c  

^a UNIVERSITY OF ICELAND   (Iceland)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347934596     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00124-9     Document Type: Article

References (10)

1. Boppana R.B., Halldórsson M.M. Approximating maximum independent sets by excluding subgraphs. BIT. 32:1992;180-196.
2. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
3. Halldórsson M.M. Approximating the minimum maximal independence number. Inform. Process. Lett. 46:1993;169-172.
4. 1-ε , Proceedings of 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 627-636.
5. S. Khanna, M. Sudan, D.P. Williamson, A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction, Proceedings of 29th ACM Symposium on Theory of Computing, 1997, pp. 11-20.
6. J. Kratochvíl, Perfect codes in general graphs, monograph, Academia Praha, 1991.
7. Kratochvíl J., Manuel P., Miller M. Generalized domination in chordal graphs. Nordic J. Comput. 2:1995;41-50.
8. T.J. Schaefer, The complexity of satisfiability problems, Proceedings of 10th ACM Symposium on Theory of Computing, 1978, pp. 216-226.
9. J.A. Telle, Characterization of domination-type parameters in graphs, Proceedings of 24th Southeastern International Conference on Combinatorics, Graph Theory and Computing - Congressus Numerantium, Vol. 94, 1993, pp. 9-16.
10. Telle J.A. Complexity of domination-type problems in graphs. Nordic J. Comput. 1:1994;157-171.