Volume 34, Number 2, April II 1996
|Page(s)||85 - 90|
|Published online||01 September 2002|
Local minima in the graph bipartitioning problem
Institut für Theoretische Chemie, Universität Wien,
Währingerstraße 17, A-1090 Wien, Austria
2 Santa Fe Institute - 1399 Hyde Park Rd., Santa Fe, NM 87501, USA
Accepted: 6 March 1996
We report numerical simulations on the number of local minima in the landscape of the Graph Bipartitioning Problem and provide an explanation in terms of the correlation length of its landscape.
PACS: 02.70.Lq – Monte Carlo and statistical methods / 75.50.Lk – Spin glasses and other random magnets
© EDP Sciences, 1996
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.