The DFS-heuristic for orthogonal graph drawing (Q5943316)
From MaRDI portal
!
WARNING
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 1642694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The DFS-heuristic for orthogonal graph drawing |
scientific article; zbMATH DE number 1642694 |
Statements
The DFS-heuristic for orthogonal graph drawing (English)
0 references
27 September 2001
0 references
orthogonal graph drawings
0 references
0.93456197
0 references
0.8994969
0 references
0 references
0.88014805
0 references
0.8777953
0 references
0.8763991
0 references
0.8763991
0 references
0.87592924
0 references
0.8733162
0 references
