k-restricted edge-connectivity in triangle-free graphs.
Andreas HoltkampDirk MeierlingLuis Pedro MontejanoPublished in: Discret. Appl. Math. (2012)
Keyphrases
- weighted graph
- strongly connected
- undirected graph
- directed graph
- graph connectivity
- edge detection
- minimum spanning trees
- edge information
- topological information
- triangle mesh
- graph matching
- connected components
- edge weights
- multiple scales
- disjoint paths
- vertex set
- edge detector
- subgraph isomorphism
- graph theory
- graph databases
- graph model
- densely connected
- image segmentation
- graph clustering
- random graphs
- graph representation
- edge map
- approximation algorithms