An improved recursive graph bipartitioning algorithm for well balanced domain decomposition.
Astrid CasadeiPierre RametJean RomanPublished in: HiPC (2014)
Keyphrases
- computational cost
- decomposition algorithm
- significant improvement
- dynamic programming
- minimum spanning tree
- graph partitioning
- preprocessing
- np hard
- optimization algorithm
- matching algorithm
- graph theory
- k means
- learning algorithm
- graph model
- shortest path problem
- recognition algorithm
- graph based algorithm
- expectation maximization
- linear programming
- cost function
- computational complexity
- segmentation algorithm
- detection algorithm
- tree structure
- particle swarm optimization
- graph matching
- semi supervised
- optimal solution
- objective function
- similarity measure
- recursive algorithm
- maximum flow
- neural network