On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems☆
Under an Elsevier user license
open archive
Keywords
Permutation graphs
Dynamic programming
Cell flipping
VLSI layout
Clique number
Stable set number
Independent set number
Multiprocessor scheduling
Cited by (0)
Copyright © 2005 Elsevier B.V. All rights reserved.