An optimal algorithm for cycle breaking in directed graphs.
Tatiana OrensteinZvi KohaviIrith PomeranzPublished in: J. Electron. Test. (1995)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- directed graph
- significant improvement
- high accuracy
- objective function
- computational complexity
- k means
- detection algorithm
- cost function
- optimization algorithm
- computational cost
- undirected graph
- probabilistic model
- genetic algorithm
- search space
- preprocessing
- state space
- linear programming
- expectation maximization
- np hard
- recognition algorithm
- graph structure
- data structure
- globally optimal