An optimal distributed algorithm for finding a set of fundamental cycles in a graph.
Pranay ChaudhuriPublished in: Comput. Syst. Sci. Eng. (2002)
Keyphrases
- optimal solution
- dynamic programming
- preprocessing
- learning algorithm
- cost function
- graph connectivity
- exhaustive search
- worst case
- optimality criterion
- method finds
- search space
- solution path
- initial set
- input data
- error tolerance
- globally optimal
- graph based algorithm
- maximum flow
- detection algorithm
- directed graph
- probabilistic model
- graph structure
- minimum cost
- packing problem
- simulated annealing
- probability distribution
- np hard
- k means
- computational complexity
- objective function
- consistency check
- image segmentation