Neighborhood conditions for graphs and digraphs to be maximally edge-connected.
Angelika HellwigLutz VolkmannPublished in: Australas. J Comb. (2005)
Keyphrases
- neighborhood graph
- undirected graph
- directed graph
- minimum spanning trees
- weighted graph
- connected components
- edge detection
- graph theoretic
- edge information
- sufficient conditions
- vertex set
- directed acyclic graph
- edge detector
- random graphs
- adjacency graph
- equivalence classes
- connected graphs
- graph partitioning
- manifold learning
- knn
- environmental conditions
- graph databases
- graph theory
- approximation algorithms
- graph matching
- data points