An efficient algorithm for minimum feedback vertex sets in rotator graphs.
Chi-Jung KuoChiun-Chieh HsuHon-Ren LinKung-Kuei LinPublished in: Inf. Process. Lett. (2009)
Keyphrases
- times faster
- learning algorithm
- objective function
- detection algorithm
- np hard
- high accuracy
- experimental evaluation
- matching algorithm
- k means
- search space
- cost function
- dynamic programming
- undirected graph
- preprocessing
- optimization algorithm
- tree structure
- random graphs
- neural network
- spanning tree
- graph structure
- recognition algorithm
- minimum weight
- hamiltonian cycle
- graph isomorphism
- graph matching
- expectation maximization
- worst case
- probabilistic model
- computational cost
- significant improvement
- computational complexity
- optimal solution
- similarity measure