On Embedding a Graph in the Grid with the Minimum Number of Bends (Q3801098)
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 Embedding a Graph in the Grid with the Minimum Number of Bends |
scientific article; zbMATH DE number 4068320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Embedding a Graph in the Grid with the Minimum Number of Bends |
scientific article; zbMATH DE number 4068320 |
Statements
On Embedding a Graph in the Grid with the Minimum Number of Bends (English)
0 references
1987
0 references
planar embedding
0 references
rectilinear grid
0 references
bends
0 references
network flow
0 references
VLSI circuit layout
0 references
0.8493409156799316
0 references
0.8398822546005249
0 references
0.8308852910995483
0 references
0.8299389481544495
0 references
