Polyhedral study of the maximum common induced subgraph problem (Q1761750): Difference between revisions

@@ Property / cites work @@
+Q4450798
@@ Property / cites work: Q4450798 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure-mapping engine: Algorithm and examples
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Backtrack search algorithms and the maximal common subgraph problem
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
+Normal rank
@@ Property / cites work @@
+Video indexing and similarity retrieval by largest common subgraph detection using decision trees
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+<i>E</i>                     <sub>11</sub>                     and M theory
@@ Property / cites work: <i>E</i> <sub>11</sub> and M theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258518
@@ Property / cites work: Q4258518 / rank @@
+Normal rank