Covering the vertices of a graph with cycles of bounded length.
Siham BekkaiDavid ForgeMekkia KouiderPublished in: Discret. Math. (2009)
Keyphrases
- weighted graph
- labeled graphs
- adjacency matrix
- undirected graph
- random graphs
- directed graph
- graph representation
- average degree
- edge weights
- directed edges
- vertex set
- hamiltonian cycle
- planar graphs
- minimum weight
- total length
- maximum matching
- graph theoretic
- graph model
- random walk
- graph theory
- attributed graphs
- graph structure
- bipartite graph
- maximum cardinality
- maximum number
- connected subgraphs
- directed acyclic graph
- bounded treewidth
- graph matching
- betweenness centrality
- minimum spanning tree
- minimum length
- strongly connected
- graph kernels
- path length
- graph data
- graph mining
- connected components
- structured data