A robust algorithm for bisecting a triconnected graph with two resource sets.
Hiroshi NagamochiKengo IwataToshimasa IshiiPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- np hard
- detection algorithm
- worst case
- high accuracy
- objective function
- neural network
- computational complexity
- preprocessing
- graph based algorithm
- clustering method
- computational cost
- graph model
- graph structure
- parameter tuning
- graph construction
- learning algorithm
- particle swarm optimization
- computationally efficient
- experimental evaluation
- dynamic programming
- matching algorithm
- cost function
- selection algorithm
- maximum flow
- depth first search
- minimum spanning tree
- object tracking algorithm
- spanning tree
- pattern mining
- tree structure
- optimization algorithm
- segmentation algorithm
- markov random field
- k means
- data structure