Edge contractions in subclasses of chordal graphs.
Rémy BelmontePinar HeggernesPim van 't HofPublished in: Discret. Appl. Math. (2012)
Keyphrases
- undirected graph
- weighted graph
- directed graph
- spanning tree
- approximation algorithms
- edge detection
- minimum spanning trees
- graph structure
- directed acyclic graph
- graph theoretic
- minimum cost
- social networks
- edge detector
- strongly connected
- random graphs
- edge weights
- edge information
- connected components
- vertex set
- edge points
- graph clustering
- graph partitioning
- graph model
- complex networks
- graph matching
- graphical models
- image segmentation
- data sets
- graph representation
- image processing
- pattern recognition
- multiple scales
- pairwise
- temporal reasoning
- graph kernels
- bayesian networks
- series parallel
- graph databases
- network structure
- multiscale