Covering a graph with cycles passing through given edges.
Hong WangPublished in: J. Graph Theory (1997)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- directed acyclic graph
- edge weights
- graph structure
- graph representation
- nodes of a graph
- spectral embedding
- vertex set
- massive graphs
- bipartite graph
- connected components
- directed edges
- random walk
- graph theory
- graph model
- edge detector
- graph partitioning
- graph theoretic
- structured data
- shortest path
- graph based algorithm
- strongly connected components
- real world graphs
- edge map
- minimum volume
- stable set
- graph construction
- bayesian networks
- description logics