Author of the publication

A Parallel Algorithm for Finding a Separator in Planar Graphs

, and . FOCS, page 238-248. IEEE Computer Society, (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Gazit, Hillel
add a person with the name Gazit, Hillel
 

Other publications of authors with the same name

Planar Separators and the Euclidean Norm., and . SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 338-347. Springer, (1990)A Parallel Algorithm for Finding a Separator in Planar Graphs, and . FOCS, page 238-248. IEEE Computer Society, (1987)An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph., and . Inf. Process. Lett., 28 (2): 61-65 (1988)An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph.. SIAM J. Comput., 20 (6): 1046-1067 (1991)A Randomized Parallel Algorithm for Planar Graph Isomorphism., and . SPAA, page 210-219. ACM, (1990)A Randomized Parallel Algorithm for Planar Graph Isomorphism., and . J. Algorithms, 28 (2): 290-314 (1998)A Deterministic Parallel Algorithm for Planar Graphs Isomorphism. FOCS, page 723-732. IEEE Computer Society, (1991)An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. FOCS, page 492-501. IEEE Computer Society, (1986)Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs.. IPPS, page 84-91. IEEE Computer Society, (1991)