Subgraph isomorphism, matching relational structures and maximal cliques
type: Item
instance of: scholarly article
title: Subgraph isomorphism, matching relational structures and maximal cliques
zbMATH Open document ID: 0374.05043
DOI: 10.1016/0020-0190(76)90049-1
author: H. G. Barrow
author: Rod Burstall
published in: Information Processing Letters
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3582192
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
Wikidata QID: Q30053698
full work available at URL: 0020-0190(76)90049-1
OpenAlex ID: W2068379792
cites work: A versatile system for computer-controlled assembly
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Q4142699
description: scientific article; zbMATH DE number 3582192