𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random Graph Isomorphism

✍ Scribed by Babai, László; Erdo˝s, Paul; Selkow, Stanley M.

Book ID
118173685
Publisher
Society for Industrial and Applied Mathematics
Year
1980
Tongue
English
Weight
638 KB
Volume
9
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Testing Graph Isomorphism
Testing Graph Isomorphism
✍ Fischer, Eldar; Matsliah, Arie 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 263 KB
The graph isomorphism problem
The graph isomorphism problem
✍ X. Liu; D. J. Klein 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 598 KB

A chemically and graph-theoretically relevant problem is that of determining whether a pair of graphs G and G' are isomorphic. A two-stage computational test is developed. In the first stage an "eigenvalue-eigenprojector" tabular graph-theoretic invariant is computed, whence if the two tables differ

Focality and graph isomorphism
Focality and graph isomorphism
✍ W. Imrich; G. Sabidussi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A graph is focal if the stabiliser of every vertex x fixes exactly one edge not incident with x. It is shown that the problem of testing whether a connected bipartite graph is focal has the same complexity as the graph isomorphism problem. Several other similar questions are also considered.

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