The Metropolis Algorithm for Graph Bisection.
Mark JerrumGregory B. SorkinPublished in: Discret. Appl. Math. (1998)
Keyphrases
- optimization algorithm
- learning algorithm
- experimental evaluation
- preprocessing
- k means
- graph theory
- dynamic programming
- objective function
- computational cost
- shortest path problem
- simulated annealing
- worst case
- graph model
- tree structure
- detection algorithm
- undirected graph
- random walk
- expectation maximization
- np hard
- cost function
- graph based algorithm
- search space
- optimal solution
- neural network
- solution path
- matching algorithm
- parameter estimation
- high accuracy
- significant improvement
- computational complexity