) time algorithm for finding the min length directed cycle in a graph.
James B. OrlinAntonio Sedeño-NodaPublished in: SODA (2017)
Keyphrases
- computational complexity
- segmentation algorithm
- experimental evaluation
- preprocessing
- graph based algorithm
- learning algorithm
- cost function
- dynamic programming
- particle swarm optimization
- significant improvement
- np hard
- dominating set
- computational cost
- worst case
- search space
- k means
- detection algorithm
- minimum spanning tree
- tree structure
- path length
- graph structure
- matching algorithm
- breadth first search
- spanning tree
- graph model
- recognition algorithm
- connected components
- clustering method
- markov random field
- high accuracy
- mobile robot