A modified noising algorithm for the graph partitioning problem (Q4397095)
From MaRDI portal
!
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 1170307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified noising algorithm for the graph partitioning problem |
scientific article; zbMATH DE number 1170307 |
Statements
A modified noising algorithm for the graph partitioning problem (English)
0 references
30 June 1998
0 references
combinatorial optimization
0 references
NP-hard
0 references
graph partitioning
0 references
clique partitioning
0 references
heuristics
0 references
noising method
0 references
simulated annealing
0 references
0.8389332890510559
0 references
0.8204531669616699
0 references
0.795657217502594
0 references
0.7700194120407104
0 references
0.763500452041626
0 references
