On a graph partition problem with application to VLSI layout (Q1199941)
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 a graph partition problem with application to VLSI layout |
scientific article; zbMATH DE number 96280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a graph partition problem with application to VLSI layout |
scientific article; zbMATH DE number 96280 |
Statements
On a graph partition problem with application to VLSI layout (English)
0 references
17 January 1993
0 references
graph partition
0 references
VLSI layout
0 references
circle graph
0 references
NP-complete
0 references
linear programming
0 references
perfect graphs
0 references
polynomial time algorithm
0 references
interval graphs
0 references
permutation graphs
0 references
chromatic sum
0 references
0.8149230480194092
0 references
0.8060292601585388
0 references
0.8039063811302185
0 references
0.7937082648277283
0 references
