Enumeration and maximum number of minimal connected vertex covers in graphs.
Petr A. GolovachPinar HeggernesDieter KratschPublished in: Eur. J. Comb. (2018)
Keyphrases
- maximum number
- directed graph
- undirected graph
- attributed graphs
- labeled graphs
- graph matching
- connected components
- vertex set
- maximum cardinality
- search space
- connected subgraphs
- hamiltonian cycle
- average degree
- connected graphs
- data sets
- maximal clique enumeration
- minimum weight
- series parallel
- complex structures
- spanning tree
- graph construction
- graph data
- book covers
- edge weights
- graph theoretic
- graph representation
- graph structure
- graph theory
- dynamic programming