A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given.
Halina BielakMichal PanczykPublished in: Ann. UMCS Informatica (2013)
Keyphrases
- spanning tree
- minimum spanning tree
- depth first search
- undirected graph
- minimum weight
- computational complexity
- learning algorithm
- dynamic programming
- graph based algorithm
- edge weights
- minimum cost
- graph structure
- edge disjoint
- np hard
- weighted graph
- detection algorithm
- search space
- breadth first search
- maximum flow
- social networks
- approximation algorithms
- homology generators
- root node
- bayesian networks
- k means
- particle swarm optimization
- segmentation algorithm
- ant colony optimization
- graph model
- tree structure
- graph theory