Efficient algorithm for the vertex connectivity of trapezoid graphs.
Aleksandar IlicPublished in: Inf. Process. Lett. (2013)
Keyphrases
- detection algorithm
- experimental evaluation
- undirected graph
- single pass
- np hard
- objective function
- tree structure
- recognition algorithm
- worst case
- cost function
- computational complexity
- dynamic programming
- matching algorithm
- computationally efficient
- learning algorithm
- graph isomorphism
- hamiltonian cycle
- connected components
- clustering method
- optimization algorithm
- high accuracy
- significant improvement
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- directed graph
- graph structure
- high efficiency
- spanning tree
- computational cost
- minimum spanning tree
- strongly connected
- lower bound
- search algorithm