Paths containing two adjacent edges in (2k+1)-edge-connected graphs.
Haruko OkamuraPublished in: Discret. Math. (1993)
Keyphrases
- edge information
- edge detector
- weighted graph
- connected graphs
- disjoint paths
- edge detection
- edge map
- undirected graph
- step edges
- edge pixels
- shortest path
- edge orientation
- multiple scales
- edge enhancement
- edge direction
- image edges
- edge segments
- directed graph
- edge detection algorithm
- edge weights
- edge linking
- edge localization
- homogeneous areas
- detected edges
- gradient direction
- junction detection
- canny edge
- sharp edges
- subpixel accuracy
- canny edge detection
- region growing
- edge strength
- multiscale
- edge points
- zero crossing
- image gradient
- gradient operators
- gradient magnitude
- closed form
- approximation algorithms
- edge directed
- high curvature
- vertex set
- interpolation method
- graph structure
- straight line segments
- smooth regions
- scale space
- input image