✦ LIBER ✦

A method of determining graph isomorphism

✍ Scribed by V. K. Pogrebnoi

Publisher: Springer US
Year: 1982
Tongue: English
Weight: 923 KB
Volume: 18
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074524

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method for the recognition of graph is

A method for the recognition of graph isomorphism

✍ V. M. Kureichik; A. G. Korolev 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 613 KB

A graph isomorphism algorithm using pseu

A graph isomorphism algorithm using pseudoinverses

✍ J. M. Bennett; J. J. Edwards 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 647 KB

Hamiltonian isomorphism of graphs

✍ M. A. Zaitsev 📂 Article 📅 1979 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 319 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

Graph isomorphism and theorems of Birkho

Graph isomorphism and theorems of Birkhoff type

✍ G. Tinhofer 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 601 KB

Natural Isomorphism Classes of Cycle Per

Natural Isomorphism Classes of Cycle Permutation Graphs Over a Graph

✍ Hye Kyung Kim; Jin Hwan Kim; Daekeun Lim 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 134 KB