The Metropolis algorithm for graph bisection (Q1383365)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1139429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Metropolis algorithm for graph bisection |
scientific article; zbMATH DE number 1139429 |
Statements
The Metropolis algorithm for graph bisection (English)
0 references
13 March 2000
0 references
simulated annealing
0 references
optimal bisection of a random graph
0 references
Metropolis algorithm
0 references
0 references
0.8012723326683044
0 references
0.7996997237205505
0 references
0.7983450293540955
0 references
0.7950606942176819
0 references
