A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- 1 December 1973
- journal article
- Published by Springer Nature in Calcolo
- Vol. 9 (4) , 341-352
- https://doi.org/10.1007/bf02575586
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A technique for graph embedding with constraints on node and arc correspondencesInformation Sciences, 1973
- Isomorfismo fra grafi: Un algoritmo efficiente per trov are tutti gli isomorfismiCalcolo, 1971
- A weighted graph embedding technique and its application to automatic circuit LayoutCalcolo, 1971
- Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientatiCalcolo, 1971
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- A note on the derivation of maximal compatibility classesCalcolo, 1966
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959