Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs.
Fawaz M. Al-AzemiMehmet Hakan KaraataPublished in: SSS (2011)
Keyphrases
- undirected graph
- disjoint paths
- preprocessing
- computational cost
- objective function
- computational complexity
- optimal solution
- np hard
- weighted graph
- detection algorithm
- image segmentation
- adjacency graph
- strongly connected
- graph partitioning
- segmentation algorithm
- expectation maximization
- dynamic programming
- k means
- optimization algorithm
- upper bound
- matching algorithm
- graph structure
- color images
- search space
- data structure
- learning algorithm