An algorithm to increase the node-connectivity of a digraph by one.
András FrankLászló A. VéghPublished in: Discret. Optim. (2008)
Keyphrases
- computational complexity
- experimental evaluation
- improved algorithm
- recognition algorithm
- high accuracy
- matching algorithm
- tree structure
- dynamic programming
- np hard
- significant improvement
- cost function
- learning algorithm
- optimization algorithm
- k means
- preprocessing
- decision trees
- undirected graph
- xml documents
- neural network
- selection algorithm
- objective function
- optimal solution
- computationally efficient
- input data
- computational cost
- detection algorithm
- data structure
- classification algorithm
- expectation maximization
- search space