Removable edges in cyclically 4-edge-connected cubic graphs.
Lars Døvling AndersenHerbert FleischnerBill JacksonPublished in: Graphs Comb. (1988)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- connected components
- directed graph
- edge information
- edge detector
- vertex set
- spanning tree
- real world graphs
- edge detection
- multiple scales
- edge map
- edge pixels
- image edges
- edge direction
- edge linking
- edge localization
- edge enhancement
- approximation algorithms
- graph clustering
- shortest path
- step edges
- graph structure
- edge orientation
- random walk
- bipartite graph
- edge detection algorithm
- sharp edges
- minimum spanning trees
- minimum cost
- edge points
- random graphs
- canny edge
- graph theoretic
- binary images
- densely connected
- homogeneous areas
- adjacency graph
- strongly connected
- level set
- data objects
- detected edges
- edge directed
- connected graphs
- junction detection
- image processing
- gradient magnitude
- image gradient
- b spline
- graph databases
- graph mining
- graph matching
- image structure