Michael T. Goodrich
- 1.R.J. Anderson and G.L. Miller, "Deterministic Parallel List Ranking," A WOC '88, 81-90. Google Scholar
Digital Library
- 2.J.L. Bentley and D. Wood, "An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles," IEEE Trans. on Computers, C- 29(7), 1980, 571-576.Google ScholarDigital Library
- 3.S.N. Bhatt and F.T. Leighton, "A Framework fo# Solving VLSI Graph Layout Problems," J. Comp. and Sys. Sci., 28(2), 1984, 300-343.Google ScholarCross Ref
- 4.R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," 3. A CM, 21(2), 1974, 201-206. Google ScholarDigital Library
- 5.B. Chuelle, "A Theorem on Polygon Cutting with Applications," #3rd FOCS, 1982, 339-349.Google Scholar
- 6.B. Chazelle, "Triangulating s Simple Polygon in Linear Time," Disc. and Comp. Geom., 6, 1991, 485-524. Google ScholarDigital Library
- 7.K.L. Clsrkson, R. Cole, and R.E. Tarjan, "Randomized Parallel Algorithms for Trapezoidal Disgrams," Proc. 7th A CM Syrup. on Computational Geometry, 1991, 152-161. Google ScholarDigital Library
- 8.R. Cole, "Parallel Merge Sort," SIAM 3. Cornput., 17(4), 1988, 770-785. Google ScholarDigital Library
- 9.R. Cole and U. Vishkin, "Approximate Parallel Scheduling, Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM ?. Comput., 17(1), 1988, 128-142. Google ScholarDigital Library
- 10.R. Cole and U. Vishkin, "The Accelerated Centroid Decomposition Technique for Optimal Paxallel Tree Evaluation in Logarithmic Time," Algorithmica, 3, 1988, 329-346.Google Scholar
- 11.R. Cole and O. Zajicek, "An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location," J. Par. and Dist. Comput., 8, 1990, 280-285. Google ScholarDigital Library
- 12.G.N. Fzederickson, "Fast Algorithms for Shortest Paths in Planar Graphs, with Applications," SIAM Y. Comput., 6, 1987, 1004-1022. Google ScholarDigital Library
- 13.M.R. Garey, D.S. Johnson, F.P. Prepsrata, and R.E. Taxjan, "Triangulating s Simple Polygon," IPL, T(4), 1978, 175-179.Google Scholar
- 14.H. Gazit and G.L. Miller, "A Parallel Algorithm for Finding s Separator in Planar Graphs," #Sth FOCS, 1987, 238-248.Google Scholar
- 15.M.T. Goodrich, "Triangulating a Polygon in Parallel," 3. of Algorithms, 10, 1989, 327-351. Google ScholarDigital Library
- 16.M.T. Goodrich, S. Shauck, and S. Guha, "Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons," Prec. 6th A CM Syrup. on Computational Geometry, 1990, 73-82. Google ScholarDigital Library
- 17.M.T. Goodrich and R. T#massis, "Dynamic Trees and Dynamic Point Location," #3rd STOC, 1991, 523-533. Google ScholarDigital Library
- 18.L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, "Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons," Proceedings of the Second Symposium on Computational Geometry, 1986, 1-13. Google ScholarDigital Library
- 19.C. Kruskal, L. Rudolph, and M. Snip, "The Power of Paxailel Prefix," Proc. 1985 IEEE Int. Conf. on Parallel Proc., 180-185.Google Scholar
- 20.R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," 3. A CM, 1980, 831-838. Google ScholarDigital Library
- 21.R.J. Lipton and R.E. Tsrjan, "A Separator Theorem for Planar Graphs," SIAM 3. Appl. Math., 36(2), 1979, 177-189.Google ScholarDigital Library
- 22.R.J. Lipton and R.E. Tarjan, "Applications of a Planar Separator Theorem," SIAM 3. Comput., 9(3), 1980, 615-627.Google ScholarDigital Library
- 23.G.L. Miller, "Finding Small Simple Cycle Separators for 2-Connected Plana# Graphs," 3. Comp. and Sys. Sci., 32, 1986, 265-279. Google ScholarDigital Library
- 24.D.D. Sleator and R.E. Tsrjsn, "A Data Structure for Dynamic Trees," J.C.S.S., 26, 362-391, 1983. Google ScholarDigital Library
- 25.C.K. Yap, "Parallel Triangulation of a Polygon in Two Calls to the Tmpezoided Map,# Algorithmica, 3, 1988, 279-288.Google ScholarDigital Library
Index Terms
- Planar separators and parallel polygon triangulation (preliminary version)
Recommendations
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators
Whitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later, Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every such triangulation on $n$ vertices has at least $2(n - 2)(n - 4)$ hamiltonian cycles. Along this ...
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Many works related to dually chordal graphs, their cliques and neighborhoods were published by Brandstadt et al. (1998) [1] and Gutierrez (1996) [6]. We will undertake a similar study by considering minimal vertex separators and their properties ...
Comments