On the Complexity of Finding a Minimum Cycle Cover of a Graph.
Carsten ThomassenPublished in: SIAM J. Comput. (1997)
Keyphrases
- edge disjoint
- spanning tree
- graph theory
- structured data
- worst case
- graph model
- dominating set
- graph search
- random walk
- bipartite graph
- computational cost
- graph structure
- stable set
- maximum clique
- minimum cost
- computational complexity
- graph representation
- graph theoretic
- data structure
- data sets
- neural network
- minimum cut
- graph based algorithm
- strongly connected
- bounded treewidth
- space complexity
- database
- weighted graph
- directed graph
- upper bound