Highly edge-connected detachments of graphs and digraphs.
Alex R. BergBill JacksonTibor JordánPublished in: J. Graph Theory (2003)
Keyphrases
- undirected graph
- directed graph
- weighted graph
- connected components
- minimum spanning trees
- neighborhood graph
- edge weights
- markov models
- graph structure
- directed acyclic graph
- connected graphs
- random graphs
- random walk
- approximation algorithms
- edge detection
- complex networks
- binary images
- multiple scales
- edge detector
- subgraph isomorphism
- level set
- equivalence classes
- graph partitioning
- edge map
- graph mining
- graph structures
- database
- d objects
- pattern recognition