Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration.
Jean-François CouturierPinar HeggernesPim van 't HofDieter KratschPublished in: SOFSEM (2012)
Keyphrases
- minimal subsets
- upper bound
- graph theory
- graph representation
- graph based algorithm
- random walk
- equivalence classes
- graph matching
- graph structure
- weighted graph
- error bounds
- lower bound
- bounded degree
- graph theoretic
- disjoint sets
- directed graph
- upper and lower bounds
- graph search
- multi class
- link analysis
- convex combinations
- symmetric difference
- definite clause
- graph partitioning
- structured data
- worst case
- dynamic programming