✦ LIBER ✦

A new algorithm for digraph isomorphism

✍ Scribed by Narsingh Deo; J. M. Davis; R. E. Lord

Publisher: Springer Netherlands
Year: 1977
Tongue: English
Weight: 976 KB
Volume: 17
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for solving the tree iso

A new algorithm for solving the tree isomorphism problem

✍ A. Jovanović; D. Danilović 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 549 KB

Algorithm for the optimal reconstruction

Algorithm for the optimal reconstruction of a digraph

✍ V. V. Malyshko; S. S. Yanchenko 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 379 KB

Algorithms for interval catch digraphs

✍ Erich Prisner 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 832 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 subgraph isomorphism algorithm using r

A subgraph isomorphism algorithm using resolution

✍ J.K. Cheng; T.S. Huang 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 675 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