Using local similarity measures to efficiently address approximate graph matching (Q496650): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.01.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2069543418
@@ Property / OpenAlex ID: W2069543418 / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining traceability links during object-oriented software evolution
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+On the use of similarity metrics for approximate graph matching
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3671211
@@ Property / cites work: Q3671211 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph isomorphism, general remarks
@@ Property / cites work: Graph isomorphism, general remarks / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
+Normal rank
@@ Property / cites work @@
+A comparative study of ant colony optimization and reactive search for graph matching problems
+Normal rank
@@ Property / cites work @@
+A distance measure between attributed relational graphs for pattern recognition
+Normal rank
@@ Property / cites work @@
+An eigendecomposition approach to weighted graph matching problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:496650