Double-row planar routing and permutation layout (Q3952043): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230120307 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057197877 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On optimum single-row routing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case / rank | |||
Normal rank | |||
Revision as of 15:24, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Double-row planar routing and permutation layout |
scientific article |
Statements
Double-row planar routing and permutation layout (English)
0 references
1982
0 references
layout for integrated circuits and printed circuit boards
0 references
interval graphical representation
0 references
NP-completeness
0 references
polynomial-time heuristic algorithm
0 references
