Covering the vertices of a graph by cycles of prescribed length.
Denise AmarIrène FournierAnne GermaPublished in: J. Graph Theory (1989)
Keyphrases
- weighted graph
- labeled graphs
- adjacency matrix
- undirected graph
- random graphs
- hamiltonian cycle
- edge weights
- graph representation
- planar graphs
- directed edges
- attributed graphs
- minimum weight
- graph structure
- graph theoretic
- bipartite graph
- betweenness centrality
- vertex set
- graph model
- maximum cardinality
- maximum matching
- random walk
- shortest path
- minimum length
- directed graph
- connected components
- average degree
- maximal cliques
- graph matching
- graph structures
- phase transition
- graph theory
- graph partitioning
- graph mining
- structured data
- subgraph isomorphism
- graph based algorithm
- total length
- query graph
- path length
- connected subgraphs
- neural network