Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 4 (1996), Issue 1, Pages 33-40
http://dx.doi.org/10.1155/1996/40175

Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs

1Department of Computer Science, Old Dominion University, Norfolk 23529-0162, VA, USA
2Department of Math and Computer Science, Elizabeth City State University, Elizabeth City 27909, NC, USA
3Department of Computer Science, Old Dominion University, Norfolk 23529-0162, VA, USA

Received 17 December 1992; Revised 30 July 1993

Copyright © 1996 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, and J. Zhang, “Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs,” VLSI Design, vol. 4, no. 1, pp. 33-40, 1996. doi:10.1155/1996/40175