A new LBFS-based algorithm for cocomparability graph recognition.
Jérémie DusartMichel HabibPublished in: Discret. Appl. Math. (2017)
Keyphrases
- recognition algorithm
- expectation maximization
- graph structure
- optimal solution
- cost function
- computational complexity
- k means
- detection algorithm
- similarity measure
- graph based algorithm
- matching algorithm
- optimization algorithm
- objective function
- dynamic programming
- computational cost
- significant improvement
- preprocessing
- learning algorithm
- minimum spanning tree
- recognition accuracy
- clustering method
- np hard
- particle swarm optimization
- recognition rate
- solution path
- connected components
- graph construction
- undirected graph
- spanning tree
- character recognition
- object recognition
- convergence rate
- tree structure
- binary images
- probabilistic model