✦ LIBER ✦

A fast backtrack algorithm for graph isomorphism

✍ Scribed by Hari Ballabh Mittal

Book ID: 113163176
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 492 KB
Volume: 29
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90037-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 (sub)graph isomorphism algorithm for m

A (sub)graph isomorphism algorithm for matching large graphs

✍ Cordella, L.P.; Foggia, P.; Sansone, C.; Vento, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 549 KB

On the Impossibility of a Quantum Sieve

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism

✍ Moore, Cristopher; Russell, Alexander; Śniady, Piotr 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 302 KB

Backtrack: An O(1) expected time algorit

Backtrack: An O(1) expected time algorithm for the graph coloring problem

✍ Herbert S. Wilf 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 204 KB

A nonfactorial algorithm for testing iso

A nonfactorial algorithm for testing isomorphism of two graphs

✍ Mark.K. Goldberg 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 490 KB