Extremal optimization of graph partitioning at the percolation threshold

DOI10.1088/0305-4470/32/28/302zbMath0953.90059arXivcond-mat/9901353OpenAlexW3101401805WikidataQ62599738 ScholiaQ62599738MaRDI QIDQ4947672

Stefan Boettcher

Publication date: 25 April 2000

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9901353

zbMATH Keywords

simulated annealinggraph partitions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Extremal optimization for protein folding simulations on the lattice ⋮ Faster Monte Carlo simulations at low temperatures. The waiting time method ⋮ The peculiar phase structure of random graph bisection ⋮ Nature's way of optimizing ⋮ Spines of random constraint satisfaction problems: definition and connection with computational complexity

This page was built for publication: Extremal optimization of graph partitioning at the percolation threshold