Further remarks on partitioning the edges of a graph.
Anthony J. W. HiltonRhys Price JonesPublished in: J. Comb. Theory, Ser. B (1978)
Keyphrases
- vertex set
- weighted graph
- directed graph
- graph partitioning
- undirected graph
- spanning tree
- directed acyclic graph
- edge weights
- partitioning algorithm
- minimum cut
- directed edges
- graph model
- graph theory
- spectral graph
- graph theoretic
- spectral embedding
- nodes of a graph
- random walk
- graph representation
- massive graphs
- real world graphs
- image structure
- bipartite graph
- graph clustering
- maximum flow
- shortest path
- duplicate detection
- graph search
- min cut
- normalized cut
- connected components
- stable set
- graph structure
- structured data
- strongly connected components
- d objects
- web graph
- denoising