Maximally edge-connected and vertex-connected graphs and digraphs: A survey.
Angelika HellwigLutz VolkmannPublished in: Discret. Math. (2008)
Keyphrases
- connected graphs
- undirected graph
- directed graph
- disjoint paths
- connected components
- approximation algorithms
- vertex set
- minimum cost
- closed form
- complex networks
- strongly connected
- markov random field
- edge detection
- directed acyclic graph
- spanning tree
- markov models
- multiple scales
- edge weights
- graph structure
- edge information
- multiscale
- machine learning
- neural network
- edge detector
- equivalence classes
- special case
- case study