0008-0624
1126-5434
Calcolo
In this note the problem is considered of finding maximal common subgraphs of two given graphs. A technique is described by which this problem can be stated as a problem of deriving maximal compatibility classes. A known «maximal compatibility classes» algorithm can then be used to derive maximal common subgraphs. The same technique is shown to apply to the classical subgraph isomorphism problem.
https://scigraph.springernature.com/explorer/license/
research_article
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
341
http://link.springer.com/10.1007%2FBF02575586
1973-12
2019-04-11T13:36
articles
false
1973-12-01
en
4
Medical and Health Sciences
10.1007/bf02575586
doi
Springer Nature - SN SciGraph project
pub.1041808659
dimensions_id
G.
Levi
Istituto di Elaborazione della Informazione del C.N.R., Via S. Maria 46, 56100, Pisa
readcube_id
c7288eee3fde18850f00f08c910fe6e59e6cf167eaa5b7578f85e6eab86780f5
Clinical Sciences
9