The Metropolis algorithm for graph bisection
type: Item
instance of: scholarly article
title: The Metropolis algorithm for graph bisection
zbMATH Open document ID: 0932.60079
DOI: 10.1016/S0166-218X(97)00133-9
author: Gregory B. Sorkin
author: Mark Jerrum
published in: Discrete Applied Mathematics
publication date: 2000-03-13T00:00:00Z
Mathematics Subject Classification ID: 60J20
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 60J10
zbMATH DE Number: 1139429
zbMATH Keywords: simulated annealing
zbMATH Keywords: optimal bisection of a random graph
zbMATH Keywords: Metropolis algorithm
MaRDI profile type: Publication
cites work: Biased random walks
cites work: Q4207934
cites work: The solution of some random NP-hard problems in polynomial expected time
cites work: Q5538132
cites work: Q5624436
cites work: Survival time of a random graph
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Cooling Schedules for Optimal Annealing
cites work: Large Cliques Elude the Metropolis Process
cites work: Approximating the Permanent
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
cites work: Convergence and finite-time behavior of simulated annealing
cites work: Average-case analysis of algorithms for matchings and related problems
cites work: The effect of the density of states on the Metropolis algorithm
cites work: The time complexity of maximum matching by simulated annealing
cites work: Efficient simulated annealing on fractal energy landscapes
cites work: Markov Chains with Rare Transitions and Simulated Annealing
full work available at URL: s0166-218x(97)00133-9
OpenAlex ID: W2024281442
description: scientific article; zbMATH DE number 1139429