Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
type: Item
instance of: scholarly article
title: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
zbMATH Open document ID: 0442.68065
DOI: 10.1016/0020-0255(79)90023-9
author: J. J. McGregor
published in: Information Sciences
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3690719
zbMATH Keywords: relational consistency algorithms
zbMATH Keywords: determination of subgraph and graph isomorphisms
zbMATH Keywords: tree search algorithms
zbMATH Keywords: path consistency algorithms
MaRDI profile type: Publication
full work available at URL: 0020-0255(79)90023-9
OpenAlex ID: W2022739485
cites work: Q4773298
cites work: A new type of computer for problems in propositional logic, with greatly reduced scanning procedures
cites work: Q4138187
cites work: An Efficient Algorithm for Graph Isomorphism
cites work: THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS
cites work: Q4142699
cites work: A Proof Procedure Using Connection Graphs
cites work: Consistency in networks of relations
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Scene Labeling by Relaxation Operations
cites work: An Algorithm for Subgraph Isomorphism
cites work: A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
description: scientific article; zbMATH DE number 3690719