Algorithmic Aspects of Domination in Graphs

Graph theory was founded by Euler [78] in 1736 as a generalization to the solution of the famous problem of the Konisberg bridges. From 1736 to 1936, the same concept as graph, but under different names, was used in various scientific fields as models of real world problems, see the historic book by Biggs, Lloyd and Wilson [19]. This chapter intents to survey the domination problem in graph theory, which is a natural model for many location problems in operations research, from an algorithmic point of view.

[1]  K. Arvind,et al.  Connected Domination and Steiner Set on Weighted Permutation Graphs , 1992, Inf. Process. Lett..

[2]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[3]  Zsolt Tuza,et al.  Algorithmic Aspects of Neighborhood Numbers , 1993, SIAM J. Discret. Math..

[4]  S. Lakshmivarahan,et al.  A New Approach for the Domination Problem on Permutation Graphs , 1991, Inf. Process. Lett..

[5]  Stephen T. Hedetniemi,et al.  On the computational complexity of upper fractional domination , 1990, Discret. Appl. Math..

[6]  Yehoshua Perl,et al.  Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..

[7]  Michael R. Fellows,et al.  Perfect domination , 1991, Australas. J Comb..

[8]  C. Pandu Rangan,et al.  Linear Algorithm for Domatic Number Problem on Interval Graphs , 1989, Inf. Process. Lett..

[9]  D. West.  Introduction to Graph Theory , 1995 .

[10]  Andreas Brandstädt,et al.  The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs , 1987, Theor. Comput. Sci..

[11]  M. Moscarini.  Doubly chordal graphs, steiner trees, and connected domination , 1993, Networks.

[12]  Jan Arne Telle,et al.  Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..

[13]  Constant Time Computation of Minimum Dominating Sets , 1994 .

[14]  B. Gluss.  AN INTRODUCTION TO DYNAMIC PROGRAMMING , 1961 .

[15]  Alan A. Bertossi,et al.  Some parallel algorithms on interval graphs , 1987, Discret. Appl. Math..

[16]  Wei-Kuan Shih,et al.  A New Planarity Test , 1999, Theor. Comput. Sci..

[17]  Feodor F. Dragan,et al.  Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs , 1997, SIAM J. Discret. Math..

[18]  Efficient Algorithms and Partial k-trees 1 , .

[19]  Hong-Gwa Yeh,et al.  Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs , 1995, Combinatorics and Computer Science.

[20]  Feodor F. Dragan,et al.  Dually Chordal Graphs , 1993, SIAM J. Discret. Math..

[21]  Martin Farber,et al.  Independent domination in chordal graphs , 1982, Oper. Res. Lett..

[22]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[23]  Jan Arne Telle,et al.  Complexity of Domination-Type Problems in Graphs , 1994, Nord. J. Comput..

[24]  Rok Sosic,et al.  A polynomial time algorithm for the N-Queens problem , 1990, SGAR.

[25]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[26]  Martin Farber,et al.  Domination in Permutation Graphs , 1985, J. Algorithms.

[27]  Marina Moscarini,et al.  Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..

[28]  Shiow-Fen Hwang,et al.  The edge domination problem , 1995, Discuss. Math. Graph Theory.

[29]  Alan A. Bertossi,et al.  Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..

[30]  Derek G. Corneil.  The complexity of generalized clique packing , 1985, Discret. Appl. Math..

[31]  Peter J. Slater,et al.  A Recurrence Template for Several Parameters in Series-parallel Graphs , 1994, Discret. Appl. Math..

[32]  Peter Damaschke,et al.  Domination in Convex and Chordal Bipartite Graphs , 1990, Inf. Process. Lett..

[33]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[34]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[35]  E. Howorka.  A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[36]  Stephen T. Hedetniemi,et al.  Linear Algorithms on Recursive Representations of Trees , 1979, J. Comput. Syst. Sci..

[37]  Richard C. T. Lee,et al.  The Weighted Perfect Domination Problem , 1990, Inf. Process. Lett..

[38]  Wen-Lian Hsu,et al.  A Simple Test for Interval Graphs , 1992, WG.

[39]  R. Crawford,et al.  Oceanicity and the ecological disadvantages of warm winters , 1997 .

[40]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[41]  P. B. Coaker,et al.  Applied Dynamic Programming , 1964 .

[42]  G. Nemhauser,et al.  The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs , 1984 .

[43]  Dieter Kratsch,et al.  On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[44]  Oscar H. Ibarra,et al.  Some Efficient Algorithms for Permutation Graphs , 1994, J. Algorithms.

[45]  Jeffrey S. Rohl,et al.  A Faster Lexicographical N Queens Algorithm , 1983, Inf. Process. Lett..

[46]  J. Keil,et al.  Finding minimum dominating cycles in permutation graphs , 1985 .

[47]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[48]  Stephen T. Hedetniemi,et al.  A linear algorithm for finding a minimum dominating set in a cactus , 1986, Discret. Appl. Math..

[49]  Maw-Shang Chang.  Weighted Domination of Cocomparability Graphs , 1997, Discret. Appl. Math..

[50]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[51]  Tohru Kikuno,et al.  A linear algorithm for the domination number of a series-parallel graph , 1983, Discret. Appl. Math..

[52]  Martin Farber,et al.  Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.

[53]  J. Mark Keil.  The Complexity of Domination Problems in Circle Graphs , 1993, Discret. Appl. Math..

[54]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory B.

[55]  Celina M. H. de Figueiredo,et al.  A Linear-Time Algorithm for Proper Interval Graph Recognition , 1995, Inf. Process. Lett..

[56]  Stephen T. Hedetniemi,et al.  Efficient Sets in Graphs , 1993, Discret. Appl. Math..

[57]  S. M. Hedetniemi,et al.  On the Algorithmic Complexity of Total Domination , 1984 .

[58]  C. Pandu Rangan,et al.  Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs , 1991, Theor. Comput. Sci..

[59]  G. Nemhauser,et al.  Covering, Packing and Generalized Perfection , 1985 .

[60]  Johannes H. Hattingh,et al.  Restrained domination in graphs , 1999, Discret. Math..

[61]  A. Kolen.  Solving covering problems and the uncapacitated plant location problem on trees , 1983 .

[62]  Amir Pnueli,et al.  Permutation Graphs and Transitive Graphs , 1972, JACM.

[63]  Gerard J. Chang,et al.  The Domatic Number Problem in Interval Graphs , 1990, SIAM J. Discret. Math..

[64]  Kellogg S. Booth,et al.  Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[65]  D. Corneil,et al.  A dynamic programming approach to the dominating set problem on k trees , 1987 .

[66]  Feodor F. Dragan,et al.  A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs , 1998, Networks.

[67]  Alan A. Bertossi.  On the Domatic Number of Interval Graphs , 1988, Inf. Process. Lett..

[68]  E. L. Lawler,et al.  A linear time algorithm for finding an optimal dominating subforest of a tree , 1985 .

[69]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[70]  Dieter Kratsch,et al.  On the restriction of some NP-complete graph problems to permutation graphs , 1985, FCT.

[71]  Jan Arne Telle,et al.  Efficient Sets in Partial k-Trees , 1993, Discret. Appl. Math..

[72]  Johannes H. Hattingh,et al.  On the computational complexity of upper distance fractional domination , 1993, Australas. J Comb..

[73]  Stephan Olariu,et al.  The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). , 1998, ACM-SIAM Symposium on Discrete Algorithms.

[74]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[75]  Rolf H. Möhring,et al.  An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..

[76]  Charles J. Colbourn,et al.  Permutation graphs: Connected domination and Steiner trees , 1991, Discret. Math..

[77]  Stephen T. Hedetniemi,et al.  Bibliography on domination in graphs and some basic definitions of domination parameters , 1991, Discret. Math..

[78]  Andreas Brandstädt.  The Computational Complexity of Feedback Vertex Set, Hamiltonian Circuit, Dominating Set, Steiner Tree, and Bandwidth on Special Perfect Graphs , 1987, J. Inf. Process. Cybern..

[79]  Alan A. Bertossi,et al.  Total Domination and Irredundance in Weighted Interval Graphs , 1988, SIAM J. Discret. Math..

[80]  Feodor F. Dragan,et al.  Dominating Cliques in Distance-Hereditary Graphs , 1994, SWAT.

[81]  Peter J. Slater.  Domination and location in acyclic graphs , 1987, Networks.

[82]  Maw-Shang Chang,et al.  On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs , 1997, Discret. Appl. Math..

[83]  Frank Harary,et al.  Graph Theory , 2016 .

[84]  E. Loukakis,et al.  Two algorithms for determining a minimum independent dominating set , 1984 .

[85]  Wen-Lian Hsu,et al.  Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs , 1999, SIAM J. Comput..

[86]  Jeremy P. Spinrad,et al.  On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[87]  Johannes H. Hattingh,et al.  On weak domination in graphs , 1998, Ars Comb..

[88]  Feodor F. Dragan,et al.  Dominating Cliques in Graphs with Hypertree Structures , 1994, STACS.

[89]  Stephan Olariu,et al.  Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time , 1995, WADS.

[90]  Maw-Shang Chang,et al.  Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs , 1993, Inf. Process. Lett..

[91]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[92]  S. Lakshmivarahan,et al.  An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph , 1996, SIAM J. Comput..

[93]  Martin Farber,et al.  Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[94]  Ortrud R. Oellermann,et al.  Steiner Distance-Hereditary Graphs , 1994, SIAM J. Discret. Math..

[95]  Ta. Asano.  Dynamic Programming on Intervals , 1993, Int. J. Comput. Geom. Appl..

[96]  C. P. Rangan,et al.  A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..

[97]  Y. Daniel Liang,et al.  Dominations in Trapezoid Graphs , 1994, Inf. Process. Lett..

[98]  Maw-Shang Chang,et al.  Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs , 1992, SIAM J. Comput..

[99]  G. Chang.  Total domination in block graphs , 1989 .

[100]  Antonio Sassano,et al.  A Class of Polynomially Solvable Set-Covering Problems , 1988, SIAM J. Discret. Math..

[101]  Stephan Olariu,et al.  Asteroidal Triple-Free Graphs , 1993, SIAM J. Discret. Math..

[102]  Maw-Shang Chang,et al.  Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs , 1994, J. Inf. Sci. Eng..

[103]  Peter Damaschke,et al.  Dominating cliques in chordal graphs , 1994, Discret. Math..

[104]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[105]  Feodor F. Dragan,et al.  r-Dominating cliques in graphs with hypertree structure , 1996, Discret. Math..

[106]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[107]  Wen-Lian Hsu,et al.  Linear Time Algorithms on Circular-Arc Graphs , 1991, Inf. Process. Lett..

[108]  Y. Daniel Liang.  Steiner Set and Connected Domination in Trapezoid Graphs , 1995, Inf. Process. Lett..

[109]  Richard C. T. Lee,et al.  The Weighted Perfect Domination Problem and Its Variants , 1996, Discret. Appl. Math..

[110]  S. Olariu,et al.  Optimal greedy algorithms for indifference graphs , 1992, Proceedings IEEE Southeastcon '92.

[111]  Wen-Lian Hsu,et al.  The distance-domination numbers of trees , 1982, Oper. Res. Lett..

[112]  Stephan Olariu,et al.  A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph , 1995, Inf. Process. Lett..

[113]  Mikhail J. Atallah,et al.  Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..

[114]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[115]  Reuven Bar-Yehuda,et al.  Complexity of Finding k-Path-Free Dominating Sets in Graphs , 1982, Inf. Process. Lett..

[116]  Gerard J. Chang.  Labeling algorithms for domination problems in sun-free chordal graphs , 1988, Discret. Appl. Math..

[117]  Stephen T. Hedetniemi,et al.  A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[118]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[119]  E. J. Cockayne,et al.  Computation of Dominating Partitions , 1977 .

[120]  Gerard J. Chang,et al.  The domatic number problem , 1994, Discret. Math..

[121]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[122]  Robert W. Irving.  On Approximating the Minimum Independent Dominating Set , 1991, Inf. Process. Lett..

[123]  Peter J. Slater,et al.  Efficient Edge Domination Problems in Graphs , 1993, Inf. Process. Lett..

[124]  Jan Arne Telle,et al.  Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems , 1993, WADS.

[125]  J. Mark Keil,et al.  Total Domination in Interval Graphs , 1986, Inf. Process. Lett..

[126]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[127]  Abhay Parekh,et al.  Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs , 1991, Inf. Process. Lett..

[128]  Stephen T. Hedetniemi,et al.  Optimal domination in graphs , 1975 .

[129]  Peter L. Hammer,et al.  Completely separable graphs , 1990, Discret. Appl. Math..

[130]  Klaus Simon.  A New Simple Linear Algorithm to Recognize Interval Graphs , 1991, Workshop on Computational Geometry.

[131]  A. Bertossi Alan.  On the domatic number of interval graphs , 1988 .

[132]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[133]  Peter J. Slater,et al.  R-Domination in Graphs , 1976, J. ACM.

[134]  C. Pandu Rangan,et al.  Weighted Independent Perfect Domination on Cocomparability Graphs , 1993, ISAAC.

[135]  J. Mark Keil,et al.  An optimal algorithm for finding dominating cycles in circular-arc graphs , 1992, Discret. Appl. Math..

[136]  Wayne Goddard,et al.  The Algorithmic Complexity of Minus Domination in Graphs , 1996, Discret. Appl. Math..

[137]  George L. Nemhauser,et al.  R-domination on block graphs , 1982, Oper. Res. Lett..

[138]  G. Chang,et al.  THE PATH-PARTITION PROBLEM IN BIPARTITE DISTANCE-HEREDITARY GRAPHS , 1998 .

[139]  Jacobus P. H. Wessels,et al.  The art and theory of dynamic programming , 1977 .

[140]  Maurizio A. BONUCCELLI.  Dominating sets and domatic number of circular arc graphs , 1985, Discret. Appl. Math..

[141]  C. Pandu Rangan,et al.  Total Domination in Interval Graphs Revisited , 1988, Inf. Process. Lett..

[142]  Stephan Olariu,et al.  Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs , 1995, SIAM J. Comput..

[143]  Michael A. Henning,et al.  An Algorithm to Find Two Distance Domination Parameters in a Graph , 1996, Discret. Appl. Math..

[144]  Detlef Seese,et al.  Tree-partite graphs and the complexity of algorithms , 1985, FCT.

[145]  Glenn K. Manacher,et al.  Finding a Domatic Partition of an Interval Graph in Time O(n) , 1996, SIAM J. Discret. Math..

[146]  Dieter Kratsch,et al.  Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs , 1991, Discret. Math..

[147]  P. Gács,et al.  Algorithms , 1992 .

[148]  Alan A. Bertossi,et al.  Sequential implementation of the two algorithms for the minimum weighted dominating set and minimum weighted total dominating set , 2001 .

[149]  D. R. Lick,et al.  Graph theory with applications to algorithms and computer science , 1985 .

[150]  F. Roberts.  On the compatibility between a graph and a simple order , 1971 .

[151]  A. Hoffman,et al.  Totally-Balanced and Greedy Matrices , 1985 .

[152]  Dieter Kratsch,et al.  Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..

[153]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[154]  Shiow-Fen Hwang,et al.  The k-neighbor domination problem , 1991 .

[155]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[156]  Lorna Stewart,et al.  Dominating sets in perfect graphs , 1991, Discret. Math..

[157]  Johannes H. Hattingh,et al.  The algorithmic complexity of signed domination in graphs , 1995, Australas. J Comb..

[158]  M. Satratzemi,et al.  Tree search algorithms for the dominating vertex set problem , 1993 .

[159]  Michael A. Henning,et al.  Minus domination in graphs , 1999, Discret. Math..

[160]  Ka Leung Ma.  Partition algorithm for the dominating set problem , 1990 .

[161]  T. Lowe,et al.  A dynamic programming algorithm for covering problems with (greedy) totally balanced constraint matrices , 1986 .

[162]  Dieter Kratsch,et al.  Domination and Total Domination on Asteroidal Triple-free Graphs , 2000, Discret. Appl. Math..

[163]  Lee J. White,et al.  Optimum Domination in Weighted Trees , 1978, Inf. Process. Lett..

[164]  Feodor F. Dragan,et al.  HT-graphs: centers, connected r-domination and Steiner trees , 1993, Comput. Sci. J. Moldova.

[165]  G. Chang,et al.  ALGORITHMIC ASPECTS OF MAJORITY DOMINATION , 1997 .

[166]  Stephen T. Hedetniemi,et al.  Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs , 1987 .

[167]  C. Pandu Rangan,et al.  Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs , 1993, WADS.

[168]  Sheng-Lung Peng,et al.  A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs , 1992, Inf. Process. Lett..

[169]  Kenneth H. Rosen,et al.  Applications of Discrete Mathematics , 1991 .

[170]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .