Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585)
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: Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges |
scientific article; zbMATH DE number 6033948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges |
scientific article; zbMATH DE number 6033948 |
Statements
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (English)
0 references
13 May 2012
0 references
graph
0 references
algorithm
0 references
VLSI
0 references
partial grid
0 references
NP-complete
0 references
0.7852773666381836
0 references
0.754331648349762
0 references
0.7439345717430115
0 references
