Fetching the paper…
Reading the bibliography…
In this paper, we tackle the problem of measuring similarity among graphs that represent real objects with noisy data.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M. R. Garey and D. S. Johnson · 1979
Earlier work this paper cites.
A combinatorial algorithm for calculating ligand binding
F. S. Kuhl, G. M. Crippen, and D. K. Friesen · 1984
Earlier work this paper cites.
An image understanding system using attributed symbolic representation and inexact graph-matching
M. A. Eshera and K-S Fu · 1986
Earlier work this paper cites.
Concepts and applications of molecular similarity
Mark A. Johnson and Gerald M. Maggiora · 1990
Earlier work this paper cites.
Fixed-parameter tractability and completeness II: On completeness for w [ 1 ] w[1]
R. G. Downey and M. R. Fellows · 1995
Earlier work this paper cites.
The complexity of subgraph isomorphism for classes of partial k k -trees
Arvind Gupta and Naomi Nishimura · 1996
Earlier work this paper cites.
Genetic-based search for error-correcting graph isomorphism
Y-K Wang, K-C Fan, and J-T Horng · 1997
Earlier work this paper cites.
Dissimilarity-based algorithms for selecting structurally diverse sets of compounds
P. Willett · 1999
Earlier work this paper cites.
Graph matching: Theoretical foundations, algorithms, and applications
H. Bunke · 2000
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda · 2001
Earlier work this paper cites.
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
J. W. Raymond and P. Willett · 2002
Earlier work this paper cites.
Pseudo-boolean optimization
Endre Boros and Peter L Hammer · 2002
Earlier work this paper cites.
Inexact Graph Matching Using Estimation of Distribution Algorithms
E. Bengoetxea · 2002
Cited alongside, same era.
From patterns to pathways: Gene expression data analysis comes of age
D. K. Slonim · 2002
Cited alongside, same era.
Prediction of central nervous system embryonal tumour outcome based on gene expression
S. L. Pomeroy, P. Tamayo, M. Gaasenbeek, and L. M. Sturla · 2002
Cited alongside, same era.
Admet in silico modelling: Towards prediction paradise?
H. Van De Waterbeemd and E. Gifford · 2003
Cited alongside, same era.
Optimization using quantum mechanics: Quantum annealing through adiabatic evolution
Giuseppe E Santoro and Erio Tosatti · 2006
Cited alongside, same era.
The maximum common subgraph problem: Faster solutions via vertex cover
F. N. Abu-Khzam, N. F. Samatova, M. A. Rizk, and M. A. Langston · 2007
On quadratization of pseudo-boolean functions
Endre Boros and Aritanan Gruber · 2012
Later among the works it cites.
Multiple Graph Matching and Applications
Albert S. Ribalta · 2012
Later among the works it cites.
In silico prediction of chemical Ames mutagenicity
C. Xu, F. Cheng, L. Chen, Z. Du, W. Li, G. Liu, P. W. Lee, and Y. Tang · 2012
Later among the works it cites.
Graph theoretic clique relaxations and applications
B. Balasundaram and F. Mahdavi Pajouh · 2013
Later among the works it cites.
Big Data: Are you ready for blast-off?
M. Wall · 2014
Later among the works it cites.
Genome alignment with graph data structures: A comparison
B. Kehr, K. Trappe, M. Holtgrewe, and K. Reinert · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A Point-Based Algorithm for Multiple 3D Surface Alignment of Drug-Sized Molecules
D. Baum · 2007
Cited alongside, same era.
Graph similarity scoring and matching
L. A. Zager and G. C. Verghese · 2008
Cited alongside, same era.
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
C. Vicky · 2008
Cited alongside, same era.
Benchmark data set for in silico prediction of Ames mutagenicity
Katja Hansen, Sebastian Mika, Timon Schroeter, Andreas Sutter, Antonius ter Laak, Thomas Steger-Hartmann, Nikolaus Heinrich, and Klaus-Robert Müller · 2009
Cited alongside, same era.
Clique relaxations in social network analysis: The maximum k k -plex problem
B. Balasundaram, S. Butenko, and I. V. Hicks · 2011
Cited alongside, same era.
Quantum annealing with manufactured spins
MW Johnson, MHS Amin, S Gildert, T Lanting, F Hamze, N Dickson, R Harris, AJ Berkley, J Johansson, P Bunyk, et al · 2011
Cited alongside, same era.
Fast parallel algorithms for graph similarity and matching
G. Kolliasa, M. Satheb, O. Schenkc, and A. Gramaa · 2014
Later among the works it cites.
Entanglement in a quantum annealing processor
T. Lanting, A. J. Przybysz, A. Yu. Smirnov, F. M. Spedalieri, M. H. Amin, A. J. Berkley, R. Harris, F. Altomare, S. Boixo, P. Bunyk, N. Dickson, C. Enderud, J. P. Hilton, E. Hoskinson, M. W. Johnson, E. Ladizinsky, N. Ladizinsky, R. Neufeld, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, S. Uchaikin, A. B. Wilson, and G. Rose · 2014
Later among the works it cites.
Computational role of multiqubit tunneling in a quantum annealer
Sergio Boixo, Vadim N Smelyanskiy, Alireza Shabani, Sergei V Isakov, Mark Dykman, Vasil S Denchev, Mohammad Amin, Anatoly Smirnov, Masoud Mohseni, and Hartmut Neven · 2015
Later among the works it cites.
A case study in programming a quantum annealer for hard operational planning problems
E. G. Rieffel, D. Venturelli, B. O’Gorman, M. B. Do, E. M. Prystay, and V. N. Smelyanskiy · 2015
Later among the works it cites.
Quantum annealing implementation of job-shop scheduling
D. Venturelli, D. J. J. Marchand, and G. Rojo · 2015
Later among the works it cites.
Solving the optimal trading trajectory problem using a quantum annealer
G. Rosenberg, P. Haghnegahdar, P. Goddard, P. Carr, K. Wu, and M. L. Prado · 2015
Later among the works it cites.