Covering vertices of a graph by k disjoint cycles.
Yoshimi EgawaMariko HagitaKen-ichi KawarabayashiHong WangPublished in: Discret. Math. (2003)
Keyphrases
- weighted graph
- undirected graph
- adjacency matrix
- labeled graphs
- planar graphs
- random graphs
- directed edges
- vertex set
- graph structure
- directed graph
- graph theory
- edge weights
- bipartite graph
- attributed graphs
- minimum weight
- graph theoretic
- maximum matching
- spanning tree
- random walk
- maximal cliques
- dependency graph
- hamiltonian cycle
- stable set
- average degree
- query graph
- connected subgraphs
- maximum cardinality
- graph clustering
- strongly connected
- graph search
- data sets
- graph data
- graph representation
- graph mining
- directed acyclic graph
- ranking algorithm
- connected components
- pairwise
- neural network