Quantum walk inspired algorithm for graph similarity and isomorphism (Q2681642): Difference between revisions

@@ Property / cites work @@
+Fifty years of graph matching, network alignment and network comparison
+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 @@
+A graph distance metric based on the maximal common subgraph
+Normal rank
@@ Property / cites work @@
+A classical approach to the graph isomorphism problem using quantum walks
+Normal rank
@@ Property / cites work @@
+An eigendecomposition approach to weighted graph matching problems
+Normal rank
@@ Property / cites work @@
+Quantum simulations of classical random walks and undirected graph connectivity
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Diffusion in complex social networks
@@ Property / cites work: Diffusion in complex social networks / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly regular graphs, partial geometries and partially balanced designs
+Normal rank