Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718): Difference between revisions

@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques of a graph-variations on the Bron-Kerbosch algorithm
+Normal rank
@@ Property / cites work @@
+Enumerating all connected maximal common subgraphs in two graphs
+Normal rank
@@ Property / cites work @@
+Constraint satisfaction algorithms for graph  pattern matching
+Normal rank
@@ Property / cites work @@
+A note on the derivation of maximal common subgraphs of two directed or undirected graphs
+Normal rank
@@ Property / cites work @@
+Backtrack search algorithms and the maximal common subgraph problem
+Normal rank
@@ Property / cites work @@
+Q3184605
@@ Property / cites work: Q3184605 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
+Normal rank