Heuristic method to check the realisability of a graph into a rectangular plan (Q1575024)
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: Heuristic method to check the realisability of a graph into a rectangular plan |
scientific article; zbMATH DE number 1490853
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic method to check the realisability of a graph into a rectangular plan |
scientific article; zbMATH DE number 1490853 |
Statements
Heuristic method to check the realisability of a graph into a rectangular plan (English)
0 references
14 August 2000
0 references
architectural design
0 references
compacting of electronic circuits
0 references
