A note on covering the edges of a graph with bonds.
Victor Neumann-LaraEduardo Rivera-CampoJorge UrrutiaPublished in: Discret. Math. (1999)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- directed acyclic graph
- nodes of a graph
- edge weights
- random walk
- vertex set
- directed edges
- graph representation
- spectral embedding
- stable set
- edge information
- graph theory
- connected components
- graph theoretic
- graph partitioning
- graph clustering
- graph mining
- real world graphs
- massive graphs
- image structure
- graphical representation
- adjacency matrix