Minimal dominating sets in graph classes: Combinatorial bounds and enumeration.
Jean-François CouturierPinar HeggernesPim van 't HofDieter KratschPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- minimal subsets
- random walk
- upper bound
- equivalence classes
- graph theory
- search space
- graph structure
- graph representation
- lower bound
- graph model
- structured data
- directed graph
- upper and lower bounds
- link analysis
- graph based algorithm
- bipartite graph
- graph matching
- directed acyclic graph
- graph databases
- weighted graph
- lower and upper bounds
- graph data
- multiobjective optimization
- graph search
- graphical models
- dynamic programming
- maximal clique enumeration