A neighborhood condition for graphs to be maximally k-restricted edge connected.
Shiying WangLei ZhangShangwei LinPublished in: Inf. Process. Lett. (2012)
Keyphrases
- neighborhood graph
- minimum spanning trees
- weighted graph
- undirected graph
- graph construction
- knn
- sufficient conditions
- edge detection
- manifold learning
- connected graphs
- edge weights
- graph theory
- data points
- edge detector
- graph model
- connected components
- structured objects
- vertex set
- directed graph
- series parallel
- edge information
- semi supervised
- strongly connected
- subgraph isomorphism
- neighborhood structure
- graph mining
- graph theoretic
- graph partitioning
- object recognition
- directed acyclic graph
- graph structure
- graph matching
- dimensionality reduction
- pairwise