Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.
Jørgen Bang-JensenTibor JordánPublished in: J. Algorithms (2000)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- vertex set
- directed graph
- strongly connected
- connected components
- graph connectivity
- edge information
- spanning tree
- disjoint paths
- edge detector
- graph structure
- directed acyclic graph
- edge map
- approximation algorithms
- shortest path
- bipartite graph
- image details
- graph model
- edge detection
- random walk
- densely connected
- image edges
- edge pixels
- total weight
- edge segments
- multiple scales
- random graphs
- edge enhancement
- graph representation
- homogeneous areas
- edge localization
- binary images
- step edges
- image processing
- image segmentation
- edge direction
- gradient direction
- segmented regions
- social networks
- structured data
- region growing