Fetching the paper…
Reading the bibliography…
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs.
A new measure of rank correlation
Maurice G Kendall · 1938
Earlier work this paper cites.
The hungarian method for the assignment problem
Harold W Kuhn · 1955
Earlier work this paper cites.
Fixed-cost transportation problems
Michel L Balinski · 1961
Earlier work this paper cites.
A formal basis for the heuristic determination of minimum cost paths
Peter E Hart, Nils J Nilsson, and Bertram Raphael · 1968
Earlier work this paper cites.
What is the distance between graphs
H Bunke · 1983
Earlier work this paper cites.
The evolution of the labor market for medical interns and residents: A case study in game theory
Alvin E Roth · 1984
Earlier work this paper cites.
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Roy Jonker and Anton Volgenant · 1987
Earlier work this paper cites.
Image interpolation and resampling
Philippe Thévenaz, Thierry Blu, and Michael Unser · 2000
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Yossi Rubner, Carlo Tomasi, and Leonidas J Guibas · 2000
Earlier work this paper cites.
Optimal assignment kernels for attributed molecular graphs
Holger Fröhlich, Jörg K Wegner, Florian Sieker, and Andreas Zell · 2005
Earlier work this paper cites.
Fast suboptimal algorithms for the computation of graph edit distance
Michel Neuhaus, Kaspar Riesen, and Horst Bunke · 2006
Earlier work this paper cites.
Graph based shapes representation and recognition
Rashid Jalal Qureshi, Jean-Yves Ramel, and Hubert Cardot · 2007
Earlier work this paper cites.
Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords
Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz · 2007
Cited alongside, same era.
Comparing stars: On approximating graph edit distance
Zhiping Zeng, Anthony KH Tung, Jianyong Wang, Jianhua Feng, and Lizhu Zhou · 2009
Cited alongside, same era.
Approximate graph edit distance computation by means of bipartite graph matching
Kaspar Riesen and Horst Bunke · 2009
Cited alongside, same era.
Global alignment of protein–protein interaction networks by graph matching methods
Mikhail Zaslavskiy, Francis Bach, and Jean-Philippe Vert · 2009
Cited alongside, same era.
Fast and robust earth mover’s distances
Ofir Pele and Michael Werman · 2009
Cited alongside, same era.
Speeding up graph edit distance computation through fast bipartite matching
Semi-supervised classification with graph convolutional networks
Thomas N Kipf and Max Welling · 2016
Later among the works it cites.
Variational graph auto-encoders
Thomas N Kipf and Max Welling · 2016
Later among the works it cites.
Convolutional neural networks on graphs with fast localized spectral filtering
Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst · 2016
Later among the works it cites.
On valid optimal assignment kernels and applications to graph classification
Nils M Kriege, Pierre-Louis Giscard, and Richard Wilson · 2016
Later among the works it cites.
Inductive representation learning on large graphs
Will Hamilton, Zhitao Ying, and Jure Leskovec · 2017
Later among the works it cites.
Matching node embeddings for graph similarity
Giannis Nikolentzos, Polykarpos Meladianos, and Michalis Vazirgiannis · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stefan Fankhauser, Kaspar Riesen, and Horst Bunke · 2011
Cited alongside, same era.
An efficient graph indexing method
Xiaoli Wang, Xiaofeng Ding, Anthony KH Tung, Shanshan Ying, and Hai Jin · 2012
Cited alongside, same era.
Deep graph kernels
Pinar Yanardag and SVN Vishwanathan · 2015
Cited alongside, same era.
Approximation of graph edit distance based on hausdorff matching
Andreas Fischer, Ching Y Suen, Volkmar Frinken, Kaspar Riesen, and Horst Bunke · 2015
Cited alongside, same era.
Algorithmic nuggets in content delivery
Bruce M Maggs and Ramesh K Sitaraman · 2015
Cited alongside, same era.
Learning with similarity functions on graphs using matchings of geometric embeddings
Fredrik D Johansson and Devdatt Dubhashi · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2015
Cited alongside, same era.
A point set generation network for 3d object reconstruction from a single image
Haoqiang Fan, Hao Su, and Leonidas J Guibas · 2017
Later among the works it cites.
On the exact computation of the graph edit distance
David B Blumenthal and Johann Gamper · 2018
Closest in time.
Graphrnn: Generating realistic graphs with deep auto-regressive models
Jiaxuan You, Rex Ying, Xiang Ren, William Hamilton, and Jure Leskovec · 2018
Closest in time.
Learning graph distances with message passing neural networks
Pau Riba, Andreas Fischer, Josep Lladós, and Alicia Fornés · 2018
Closest in time.
Deep learning of graph matching
Andrei Zanfir and Cristian Sminchisescu · 2018
Closest in time.