|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 5 of 5 found articles
| Title: |
The DFS-heuristic for orthogonal graph drawing ☆ ☆ Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference on Computational Geometry, Ottawa, 1996, see [1]. |
| Author: |
Biedl, Therese |
| Appeared in: |
Computational geometry |
| Paging: | Volume 18 (2001) nr. 3 pages 22 p. |
| Year: |
2001 |
| Contents: | |
| Publisher: |
Elsevier Science B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 5 of 5 found articles
| << previous |