Complexity of higher-degree orthogonal graph embedding in the Kandinsky model (Q2921402)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6352747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of higher-degree orthogonal graph embedding in the Kandinsky model |
scientific article; zbMATH DE number 6352747 |
Statements
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model (English)
0 references
8 October 2014
0 references
0.779836118221283
0 references
0.7790911793708801
0 references
0.7784973382949829
0 references
0.774000346660614
0 references
