✦ LIBER ✦

A nonfactorial algorithm for testing isomorphism of two graphs

✍ Scribed by Mark.K. Goldberg

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 490 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90078-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for optimal isomorphism bet

An algorithm for optimal isomorphism between two random graphs

✍ Dong Su Seong; Young Kyu Choi; Ho Sung Kim; Kyu Ho Park 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 449 KB

An Optimal Simple Parallel Algorithm for

An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

✍ Shan-Chyun Ku; Biing-Feng Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 91 KB

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outerplanarity. In this paper, an optimal parallel algorithm is proposed on th

A SimpleO(log N) Time Parallel Algo

A SimpleO(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

✍ Srabani Sen Gupta; Bhabani P. Sinha 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A Randomized Parallel Algorithm for Plan

A Randomized Parallel Algorithm for Planar Graph Isomorphism

✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with

A V log V algorithm for isomorphism of t

A V log V algorithm for isomorphism of triconnected planar graphs

✍ J.E. Hopcroft; R.E. Tarjan 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 476 KB

An algorithm for determining whether two triconnected planar graphs are isomorphic is presented. The asymptotic growth rate of the algorithm is bounded by a constant times ! V ! log I V [ where I V I is the number of vertices in the graphs.

On the isomorphism problem for a family

On the isomorphism problem for a family of cubic metacirculant graphs

✍ Ngo Dac Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 589 KB

In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.