A modified noising algorithm for the graph partitioning problem (Q4397095): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126528073, #quickstatements; #temporary_batch_1722291251637 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-9260(97)00007-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983330799 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126528073 / rank | |||
Normal rank | |||
Latest revision as of 13:02, 30 July 2024
scientific article; zbMATH DE number 1170307
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
