Complexity dichotomy on partial grid recognition (Q533881): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of minimizing wire lengths in VLSI layouts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The total chromatic number of some bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3154375 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The realization problem for Euclidean minimum spanning trees is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The logic engine and the realization problem for nearest neighbor graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unit-length embedding of binary trees on a square grid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expansion of layouts of complete binary trees into grids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3326832 / rank | |||
Normal rank | |||
Latest revision as of 00:24, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity dichotomy on partial grid recognition |
scientific article |
Statements
Complexity dichotomy on partial grid recognition (English)
0 references
10 May 2011
0 references
graph embedding
0 references
VLSI layout
0 references
partial grid
0 references
NP-completeness
0 references
