Complexity results

Domination in Graphs: Advanced Topics

Volumn , Issue , 2017, Pages 233-269

  Hedetniemi, Stephen T ^a   McRae, Alice A ^b   Parks, Dolores A ^b  

^a AMRL   (United States)

^b APPALACHIAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012231740     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781315141428     Document Type: Chapter

References (44)

1. O. Arora, C. Lund, R. Motwani and M. Sudan, Proof verification and intractability of approximation problems. In Proc. of the 33rd IEEE Symp. on Foundations of Computer Science (1992).
2. D. W. Bange, A. E. Barkauskas and P. J. Slater, Efficient dominating sets in graphs. In Applications of Discrete Mathematics, Eds. R. D. Ringeisen and F. S. Roberts, SIAM Philadelphia (1988) 189-199.
3. M. Bellare, S. Goldwasser, C. Lund and A. Russell, Efficient probabilistically checkable proofs and applications to approximation. In Proc. of the 25th ACM Symp. on the Theory of Computing (1993) 294-304.
4. B. Bollobás and E. J. Cockayne, Graph theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3) (1979) 241-249.
5. K. S. Booth and J. H. Johnson, Dominating sets in chordal graphs. SIAM J. Comput. 11 (1982) 191-199.
6. K. Cameron, Induced matchings. Discrete Appl. Math. 24 (1989) 97-102.
7. G. J. Chang and G. L. Nemhauser, Covering, packing, and generalized perfection. SIAM J. Alg. Discrete Melh. 6(1) (1985) 109-132.
8. E. J. Cockayne, O. Favaron, C. Payan and A. Thomason, Contributions to the theory of domination, independence, and irredundance in graphs. Discrete Math. 33(3) (1981) 249-258.
9. D. G. Corneil and Y. Perl, Clustering and domination in perfect graphs. Discrete Appl. Math. 9 (1984) 27-39.
10. A. K. Dewdney, Fast turing reductions between problems in NP; chapter 4; reductions between NP-complete problems. Technical Report 71, Dept. Computer Science, University of Western Ontario (1981).
11. G. S. Domke, Variations of colorings, coverings and packings of graphs. Ph.D. Dissertation, Clemson University (1988).
12. G.S. Domke, S.T. Hedetniemi and R. Laskar, Fractional packings, covering and irredundance in graphs. Congr. Numer. 66 (1988) 227-238.
13. J. Dunbar, W. Goddard, S. T. Hedetniemi, M. A. Henning and A. McRae, The algorithmic complexity of minus domination in graphs. Discrete Math. 68 (1996) 73-84.
14. J. E. Dunbar, F. Harris, S. M. Hedetniemi, S.T. Hedetniemi, R. Laskar and A. McRae, Nearly perfect sets in graphs. Discrete Math. 138 (1995) 229-246.
15. J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and A. McRae, Minus domination in graphs. Manuscript.
16. J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater, Signed domination in graphs. In Proc. Seventh Internal. Conf. in Graph Theory, Combinatorics, Algorithms, and Applications Kalamazoo, MI (1994) 311-322.
17. J. Edmunds, Paths, trees, and flowers. Canad. J. Math. 17 (1965) 449-467.
18. S. Even, O. Goldreich and P. Tong, On the NP-completeness of certain network testing problems. Technical Report 230, Technion, Dept. of Computer Science, Haifa, Israel (1981).
19. M. Farber, Independent domination in chordal graphs. Oper. Res. Lett. 1(4) (1982) 134-138.
20. M. Fellows, G. Fricke, S. T. Hedetniemi and D. Jacobs, The private neighbor cube. SI AM J. Discrete Math. 7(1) (1994) 41-47.
21. G. Fricke, S. M. Hedetniemi and D. P. Jacobs, When is an irredundant function on a graph maximal? Manuscript (1988).
22. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, NY, 1979.
23. H. Gavlas, K. Schultz and P. J. Slater, Efficient open domination in graphs. To appear in Scienlia.
24. F. Gavril, Algorithms for minimum colorings, maximum clique, minimum coverings by cliques, and maximum independent set of a chorda! graph. SIAM J. Comp. 1 (1972) 180-187.
25. F. Harary, Graph Theory. Addison-Wesley, Reading, MA, 1969.
26. S. M. Hedetniemi, S. T. Hedetniemi and D. P. Jacobs, Private domina-tion:theory and algorithms. Congr. Numer. 79 (1990) 147-157.
27. S. M. Hedetniemi, S. T. Hedetniemi and A. A. McRae, Matchings, match-ability, and 2-maximal matching. Manuscript (1993).
28. S. T. Hedetniemi and R. Laskar, A bipartite theory of graphs: I. Congr. Numer. 55 (1986) 5-14.
29. S. T. Hedetniemi and R. Laskar, A bipartite theory of graphs: II. Congr. Numer. 64 (1988) 137-146.
30. D. S. Hochbaum and D. B. Schmoys, A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2) (1985) 180-184.
31. R. Irving, On approximating the minimum independent dominating set. Inform. Proc. Lett. 37(4) (1991) 197-200.
32. M.S. Jacobson and K. Peters, Chordal graphs and upper irredundance, upper domination and independence. Discrete Math. 86 (1990) 59-69.
33. R. M. Karp, Reducibility among combinatorial problems. In Complexity of Computer Combinatorial Problems, Eds. R. E. Miller and J. W. Thatcher, Plemum Press New York, NY (1972).
34. R. Laskar, J. Pfaff, S.M. Hedetniemi and S. T. Hedetniemi, On the algorithmic complexity of total domination. SIAM J. Alg. Discrete Meth. 5 (1984) 420-425.
35. C. Lund and M. Yannakakis, On the hardness of approximation minimization problems. In Proc. of the 25th ACM Symp. on the Theory of Computing (1993) 286-293.
36. A. Majumdar, Neighborhood hypergraphs: a framework for covering and packing parameters in graphs. Ph.D. Dissertation, Clemson University (1992).
37. A. A. McRae, Generalizing NP-completeness Proofs for Bipartite Graphs and Chordal Graphs. Ph.D. Dissertation, Clemson University (1994).
38. C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes. In Proc. of the 20th ACM Symp. on the Theory of Computing (1988) 229-234.
39. K. Peters, Theoretical and Algorithmic Results on Domination and Connectivity. Ph.D. Disseration, Clemson University (1986).
40. J. Pfaff, R. Laskar and S. T. Hedetniemi, NP-completeness of total and connected domination and irredundance for bipartite graphs. Technical Report 428, Clemson University, Dept. of Math. Sci. (1983).
41. L. J. Stockmeyer, Planar 3-colorability is NP-complete. S1GACT News 5(3) (1973) 19-25.
42. K. Sutner, Linear cellular automata and the Garden-of-Eden. Math. Intelligencer 11(2) (1989) 49-53.
43. M. Yannakakis and F. Gavril, Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3) (1980) 364-372.
44. C. C. Yen and R. C. T. Lee, The weighted perfect domination problem. Inform. Process. Lett. 35(6) (1990) 295-299.