Lower bounds and parallel algorithms for planar orthogonal grid drawings
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 386-393
- https://doi.org/10.1109/spdp.1991.218215
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Deterministic parallel list rankingPublished by Springer Nature ,2006
- Planar orthogonal drawings of graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel Transitive Closure and Point Location in Planar StructuresSIAM Journal on Computing, 1991
- Highly parallelizable problemsPublished by Association for Computing Machinery (ACM) ,1989
- Planar grid embedding in linear timeIEEE Transactions on Circuits and Systems, 1989
- Embedding rectilinear graphs in linear timeInformation Processing Letters, 1988
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- Approximate and exact parallel scheduling with applications to list, tree and graph problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Rectilinear Graphs and Their EmbeddingsSIAM Journal on Computing, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985