Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
- 31 December 1979
- journal article
- Published by Elsevier in Information Sciences
- Vol. 19 (3) , 229-250
- https://doi.org/10.1016/0020-0255(79)90023-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMSInternational Journal of General Systems, 1978
- Consistency in networks of relationsArtificial Intelligence, 1977
- Scene Labeling by Relaxation OperationsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- Storage and retrieval of information on chemical structures by computerEndeavour, 1968
- Algorithm 266: pseudo-random numbers [G5]Communications of the ACM, 1965
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- A new type of computer for problems in propositional logic, with greatly reduced scanning proceduresInformation and Control, 1961