One-phase algorithm for the determination of minimal vertex separators of chordal graphs.
Lilian MarkenzonPaulo Renato da Costa PereiraPublished in: Int. Trans. Oper. Res. (2010)
Keyphrases
- undirected graph
- experimental evaluation
- learning algorithm
- preprocessing
- k means
- computational cost
- detection algorithm
- computational complexity
- hamiltonian cycle
- cost function
- np hard
- dynamic programming
- optimal solution
- training phase
- simulated annealing
- significant improvement
- segmentation algorithm
- optimization algorithm
- expectation maximization
- recognition algorithm
- probabilistic model
- minimum spanning tree
- adjacency graph