Paths in graphs, reducing the edge-connectivity only by two.
Wolfgang MaderPublished in: Graphs Comb. (1985)
Keyphrases
- disjoint paths
- weighted graph
- undirected graph
- strongly connected
- shortest path
- directed graph
- connected components
- minimum spanning trees
- graph matching
- graph representation
- graph theory
- edge weights
- edge detection
- graph partitioning
- graph connectivity
- random graphs
- topological information
- graph model
- multiscale
- edge information
- graph theoretic
- multiple scales
- graph structure
- adjacency graph
- graph databases
- topological features
- graph structures
- graph mining
- directed acyclic graph
- binary images
- graphical models
- pattern recognition