Hedetniemi, The certificate: a canonical data structure for trees, Congr. Parameterized complexity Finding a dominating set of size k plays a central role in the theory of parameterized complexity. Slater, Some results on the optional and non-optional Hamiltonian completion problem, Proc. The Bondage Number of a Graph J. Best Location of Service Centers in a Tree-Like Network under Budget Constraints J. Conference on Graph Theory, Western Michigan University, November, 1968.
Mitchell, Linear algorithms for mean distances in trees and unicyclic graphs, Dept. McRae, Using maximality and minimality conditions to construct inequality chains, Discrete Math. McRae, Nearly perfect sets in graphs, Discrete Math. Hedetniemi, What is a decomposition theory of automata? Hedetniemi, Double Roman domination, Discrete Appl. Miller, Properties of hereditary hypergraphs and middle graphs, Canad. Hedetniemi, On the strength of a graph, Congr.
Hedetniemi, Teaching introductory computer science: a comparison of two institutions, Proc. In fact, the problem has a kernel of size linear in k , and running times of the form O exp k n. Hedetniemi, An anonymous self-stabilizing algorithm for 1-maximal independent set in trees, Inform. There has been much work on. Hedetniemi, A note on total domination, Discrete Math.
Hedetniemi, On the equivalence of the upper open irredundance and fractional upper open irredundance numbers of a graph, J. Best Location of Service Centers in a Tree-Like Network under Budget Constraints J. Srimani, Self-stabilizing algorithms for orderings and colorings, Int. Furthermore, there is a simple algorithm that maps a dominating set to a set cover of the same size and vice versa. Hedetniemi, A linear algorithm for disjoint matchings in trees, Discrete Math. Hedetniemi, Sufficient conditions for a graph to be Hamiltonian, J. Graph Theory 11 2 :157-159, 1987.
Rall, On k-dependent domination, Discrete Math. Henning, Global defensive alliances in graphs, Electronic J. Chordal Graphs and Upper Irredundance, Upper Domination and Independence M. Published by Seventh Sense Research Group. Hedetniemi, Linear algorithms on recursive representations of trees, J.
Fricke, Relationships between integer and fractional parameters of graphs, Proc. Hedetniemi, A linear algorithm for computing the knight's domination number of a KxN chessboard, Congr. Dominating Cliques in Graphs M. Markus, Restrained domination in graphs, Discrete Math. Jacobs, Self-stabilizing maximum matchings, Congr.
Hedetniemi, Linear algorithms for independent domination and total domination in series-parallel graphs, Congr. Sudha, The covering chain of a graph, Util. The problem is that once you have gotten your nifty new product, the topics on domination hedetniemi s t laskar r c gets a brief glance, maybe a once over, but it often tends to get discarded or lost with the original packaging. Executive Committee: Computing Accreditation Commission, 2002, 2003, 2004, 2005. On Minimum Dominating Sets with Minimum Intersection D. Hedetniemi, On the diagonal queens domination problem, J. First Cumberland Conference on Graph Algorithms and Combinatorics,, Tennessee Technological University, April, 1987.
Chordal Graphs and Upper Irredundance, Upper Domination and Independence M. Hedetniemi, Disconnected colorings of graphs, in Combinatorial Structures and Their Applications, R. Jacobs, Self-stabilizing maximal k-dependent sets in linear time, Parallel Process. Hedetniemi, Another upper bound for the bandwidth of trees, Proc. Therefore a has the same size as a minimum edge dominating set.
Department of Computer Science, University of Missouri, Rolla Spring, 1980. Proskurowski, Centering a spanning tree of a biconnected graph, Inform. Hare, Algorithms for computing the domination number of KxN complete grid graphs, Congr. Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters S. Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University, June, 1992. Robinson, Uniquely colorable graphs, J. Dominating Cycles in Halin Graphs M.