Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
Amr ElmasryKurt MehlhornJens M. SchmidtPublished in: J. Graph Theory (2013)
Keyphrases
- weighted graph
- depth first search
- spanning tree
- minimum spanning trees
- minimum spanning tree
- connected components
- graph structure
- undirected graph
- tree structure
- tree search
- edge weights
- neighborhood graph
- hierarchical data structure
- breadth first search
- tree shaped
- strongly connected
- maximum weight
- graph search
- graph representation
- graph theory
- graph construction
- equivalence class
- graph model
- edge information
- edge detection
- vertex set
- graph partitioning
- directed acyclic graph
- random walk
- edge detector
- branch and bound
- equivalence classes
- graph mining
- binary images
- root node
- tree nodes
- index structure
- disjoint paths
- input image
- shortest path
- clique tree
- constraint graph
- r tree
- graph matching
- image segmentation