An algorithm for subgraph isomorphism

DMCA

An algorithm for subgraph isomorphism (1976)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by J. R. Ullmann

Venue:	JOURNAL OF THE ACM
Citations:	336 - 1 self

BibTeX

@ARTICLE{Ullmann76analgorithm,
    author = {J. R. Ullmann},
    title = {An algorithm for subgraph isomorphism},
    journal = {JOURNAL OF THE ACM},
    year = {1976},
    volume = {28},
    number = {1},
    pages = {31--42}
}

OpenURL

Abstract

Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs. A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been bmlt The hardware implementation would allow very rapid determination of isomorphism.

Keyphrases

subgraph isomorphism new algorithm clique detection parallel asynchronous logic-in-memory implementation graph isomorphism tree search successor node graph isomorphism experiment brute-force tree-search enumeration procedure vital part various nonrandom graph hardware implementation rapid determination

DMCA