H. Gazit, J.H. Reif, A randomized parallel algorithm for planar graph isomorphism, in: Proc. 2nd Ann. ACM Symposium on Parallel Algorithms and Architectures, New York, 1990, pp. 210--219.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the planar case have been found. The algorithm proposed by Hopcroft and Wong [14] takes O(V ) time (the complexity of graphs algorithms in general depends on both the numbers of edges E and of vertices V , but for planar graphs it is O(E) O(V ) Fast parallel algorithms can be found in [16]and[11]. This is of great importance for the practical feasibility of topological recognition systems, in view of the already mentioned huge amount of aspects for even relatively simple objects. Step (3) must be performed only after a match in step (2) and thus in a very small number of cases. For ....

H. Gazit, J.H. Reif, A randomized parallel algorithm for planar graph isomorphism, in: Proc. 2nd Ann. ACM Symposium on Parallel Algorithms and Architectures, New York, 1990, pp. 210--219.

....Email: reif cs.duke.edu. Supported by NSF Grant NSF IRI 91 00681, Rome Labs Contracts F30602 94 C 0037, ARPA SISTO contracts N00014 91 J 1985, and N00014 92 C 0182 under subcontract KI 92 01 0182. This paper appeared in the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece, July 1990, pp. 210 219. 1 for some classes of graphs. For example, isomorphism of trees can be solved sequentially in linear work [AHU 74] and can be solved by a randomized parallel algorithm of Miller and Reif [MR 91] using tree contraction in O(log(n) time with an optimal number of processors (or ....

H. Gazit and J. H. Reif. A randomized parallel algorithm for planar graph isomorphism. In 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 210--219. ACM, July 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC