Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs.
Petr A. GolovachPinar HeggernesDieter KratschPublished in: CoRR (2016)
Keyphrases
- maximum number
- directed graph
- labeled graphs
- undirected graph
- attributed graphs
- connected components
- maximum cardinality
- hamiltonian cycle
- connected subgraphs
- neighborhood graph
- edge weights
- search space
- graph structure
- graph theoretic
- connected graphs
- minimum weight
- complex structures
- graph matching
- graph theory
- graph model
- protein interaction networks
- graph mining
- graph representation
- directed acyclic graph
- graph partitioning
- graph patterns
- bipartite graph
- phase transition
- spanning tree
- traveling salesman problem
- dynamic programming
- average degree
- pairwise
- bayesian networks
- data sets