Covering the Edges of a Connected Graph by Paths.
László PyberPublished in: J. Comb. Theory, Ser. B (1996)
Keyphrases
- directed graph
- weighted graph
- connected components
- undirected graph
- shortest path
- directed acyclic graph
- spanning tree
- edge weights
- disjoint paths
- random walk
- real world graphs
- vertex set
- graph theoretic
- graph mining
- neighborhood graph
- graph representation
- graph partitioning
- connected graphs
- path length
- graph structure
- graph structures
- strongly connected
- maximum matching
- graph clustering
- nodes of a graph
- optimal path
- graph matching
- random graphs
- edge information
- minimum cost
- link analysis
- graph theory
- bipartite graph
- spectral embedding
- minimum volume
- binary images
- massive graphs
- graph cuts
- directed edges
- neural network