Planar stage graphs: Characterizations and applications

Theoretical Computer Science

Volumn 175, Issue 2, 1997, Pages 239-255

  Bauernöppel, Frank ^a,c   Kranakis, Evangelos ^a   Krizanc, Danny ^a   Maheshwari, Anil ^a   Sack, Jörg Rüdiger ^a   Urrutia, Jorge ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

PLANAR STAGE GRAPHS;

GRAPH THEORY;

EID: 0031123133     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00201-0     Document Type: Article

References (20)

1. M.J. Atallah, R. Cole and MT. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms, SIAM J. Comput. 18 (1989) 499-532.
2. B. Bollobás, Extremal Graph Theory (Academic Press, New York, 1978).
3. E.G. Coffman and R.L. Graham, Optimal scheduling for two-processor systems, Acta Inform. 1 (1972) 200-213.
4. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770-785.
5. A. Datta, A. Maheshwari and J.-R. Sack, Optimal parallel algorithms for direct dominance problems, in: Nordic Journal of Computing 3 (1996), 72-88.
6. B. Dushnik and E. Miller, Partially ordered sets, Amer. Math. Monthly 55 (1948) 26-28.
7. M. Fujii, T. Kasami and K. Ninomiya, Optimal sequencing of two equivalent processors, SIAM J. Appl. Math. 17 (1969) 784-789.
8. H.N. Gabow, An almost-linear algorithm for two-processor scheduling, J. ACM 29 (1982) 766-780.
9. H.N. Gabow and R.E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (1985) 209-221.
10. M.T. Goodrich, Intersecting line segments in parallel with an output-sensitive number of processors, SIAM J. Comput. 20 (1991) 737-755.
11. J. JáJá, An Introduction to Parallel Algorithms (Addison-Weseley, Reading, MA, 1992).
12. R.M. Karp and R. Vijaya Ramachandran, Parallel algorithms for shared-memory machines, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. 1 (Elsevier, Amsterdam, 1990).
13. A. Lingas and A. Maheshwari, Simple optimal parallel algorithm for reporting paths in trees, in: Proc. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science (Springer, Berlin, 1994).
14. R.M. McConnell and J.P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, in: Proc. ACM-SIAM Symp. on Discrete Algorithms (1994) 536-545.
15. S. Micali and V.V. Vazirani, An Ω(√V E) algorithm for finding maximum matching in general graphs, in: Proc. 21st Ann. IEEE Symp. Foundations of Computer Science (1980) 17-27.
16. A. Moitra and R.C. Johnson, A parallel algorithm for maximum matching on interval graphs, in: Proc. 18th Internat. Conf. on Parallel Processing III (1989) 114-120.
17. A. Pnueli, S. Even and A. Lempel, Transitive orientation of graphs and identification of permutation graphs, Canad. J. Math. 23 (1971) 160-175.
18. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
19. R. Sehti, Scheduling graphs on two processors, SIAM J. Comput. 5 (1976) 73-82.
20. J. Spinrad, On comparability and permutation graphs, SIAM J. Comput. 14 (1985) 658-670.