A note on the derivation of maximal common subgraphs of two directed or undirected graphs (Q2560433): Difference between revisions

@@ Property / cites work @@
+GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for Graph Isomorphism
@@ Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati. (A heuristic method for determinating the isomorphism of two simple non-oriented graphs)
+Normal rank
@@ Property / cites work @@
+Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
+Normal rank
@@ Property / cites work @@
+A technique for graph embedding with constraints on node and arc correspondences
+Normal rank
@@ Property / cites work @@
+A weighted graph embedding technique and its application to automatic circuit layout
+Normal rank
@@ Property / cites work @@
+A note on the derivation of maximal compatibility classes
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02575586
+Normal rank
@@ Property / OpenAlex ID @@
+W2082403159
@@ Property / OpenAlex ID: W2082403159 / rank @@
+Normal rank