Two algorithms for three dimensional orthogonal graph drawing
- 1 January 1997
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 139-154
- https://doi.org/10.1007/3-540-62495-3_44
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Drawing graphs on rectangular gridsDiscrete Applied Mathematics, 1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Planar grid embedding in linear timeIEEE Transactions on Circuits and Systems, 1989
- The complexity of minimizing wire lengths in VLSI layoutsInformation Processing Letters, 1987
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- A unified approach to visibility representations of planar graphsDiscrete & Computational Geometry, 1986
- Three-Dimensional VLSIJournal of the ACM, 1983
- Three-Dimensional Integrated CircuitryPublished by Springer Science and Business Media LLC ,1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935