On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems |
scientific article; zbMATH DE number 2189355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems |
scientific article; zbMATH DE number 2189355 |
Statements
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (English)
0 references
1 August 2005
0 references
Permutation graphs
0 references
Dynamic programming
0 references
Cell flipping
0 references
VLSI layout
0 references
Clique number
0 references
Stable set number
0 references
Independent set number
0 references
Multiprocessor scheduling
0 references
0 references
0 references
0.7165921926498413
0 references
0.7161757349967957
0 references
0.7154942154884338
0 references
0.7146167755126953
0 references
