๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A graph isomorphism algorithm using pseudoinverses

โœ Scribed by J. M. Bennett; J. J. Edwards

Publisher
Springer Netherlands
Year
1996
Tongue
English
Weight
647 KB
Volume
36
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 Identification Mat
Graph Isomorphism and Identification Matrices: Sequential Algorithms
โœ Lin Chen ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

A number of properties on identification matrices are presented here. For example, we prove that adjacency matrices are identification matrices for all bipartite graphs. We also study the application of the theory of identification matrices to solving the graph isomorphism problem, a famous open pro