A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given.
Halina BielakMichal PanczykPublished in: FedCSIS (2013)
Keyphrases
- spanning tree
- minimum spanning tree
- depth first search
- weighted graph
- undirected graph
- graph structure
- detection algorithm
- worst case
- computational complexity
- dynamic programming
- simulated annealing
- minimum weight
- k means
- breadth first search
- learning algorithm
- search space
- graph based algorithm
- minimum cost
- optimal solution
- tree structure
- graph search
- edge disjoint
- directed graph
- segmentation method
- segmentation algorithm
- objective function
- multimedia