Enumeration of minimal connected dominating sets for chordal graphs.
Petr A. GolovachPinar HeggernesDieter KratschReza SaeiPublished in: Discret. Appl. Math. (2020)
Keyphrases
- minimal subsets
- undirected graph
- connected components
- graph theory
- pattern recognition
- connected graphs
- series parallel
- neural network
- graph theoretic
- search space
- graph matching
- neighborhood graph
- graph construction
- graph partitioning
- bayesian networks
- multiobjective optimization
- graph representation
- bipartite graph
- dynamic programming
- lower bound