Fetching the paper…
Reading the bibliography…
The ability to compute similarity scores between graphs based on metrics such as Graph Edit Distance (GED) is important in many real-world applications.
Graph Matching Networks for Learning the Similarity of Graph Structured Objects
Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, and Pushmeet Kohli. 2019 · 1904
Earlier work this paper cites.
Hongyang Gao and Shuiwang Ji. 2019 · 1905
Earlier work this paper cites.
A new measure of rank correlation
Maurice G Kendall. 1938 · 1938
Earlier work this paper cites.
The Hungarian method for the assignment problem
Harold W Kuhn. 1955 · 1955
Earlier work this paper cites.
On random graphs
Paul Erdos. 1959 · 1959
Earlier work this paper cites.
The proof and measurement of association between two things
Charles Spearman. 1961 · 1961
Earlier work this paper cites.
A distance measure between attributed relational graphs for pattern recognition
A. Sanfeliu and K. Fu. 1983 · 1983
Earlier work this paper cites.
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Roy Jonker and Anton Volgenant. 1987 · 1987
Earlier work this paper cites.
Random graphs
Béla Bollobás and Bollobás Béla. 2001 · 2001
Earlier work this paper cites.
Measuring preferential attachment in evolving networks
Hawoong Jeong, Zoltan Néda, and Albert-László Barabási. 2003 · 2003
Earlier work this paper cites.
Similarity Search in Biological and Engineering Databases
Hans-Peter Kriegel, Martin Pfeifle, and Stefan Schönauer. 2004 · 2004
Earlier work this paper cites.
BRENDA, the enzyme database: updates and major new developments
Ida Schomburg, Antje Chang, Christian Ebeling, Marion Gremse, Christian Heldt, Gregor Huhn, and Dietmar Schomburg. 2004 · 2004
Earlier work this paper cites.
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance. In Structural, Syntactic, and Statistical Pattern Recognition , Dit-Yan Yeung, James T. Kwok, Ana Fred, Fabio Roli, and Dick de Ridder (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 163–172
Michel Neuhaus, Kaspar Riesen, and Horst Bunke. 2006 · 2006
Earlier work this paper cites.
SAGA: a subgraph matching tool for biological graphs
Yuanyuan Tian, Richard C Mceachin, Carlos Santos, David J States, and Jignesh M Patel. 2007 · 2007
Cited alongside, same era.
IAM graph database repository for graph based pattern recognition and machine learning. In Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) . Springer, 287–297
Kaspar Riesen and Horst Bunke. 2008 · 2008
Cited alongside, same era.
Community detection in a large real-world social network
Karsten Steinhaeuser and Nitesh V Chawla. 2008 · 2008
Cited alongside, same era.
Approximate graph edit distance computation by means of bipartite graph matching
Kaspar Riesen and Horst Bunke. 2009 · 2009
Cited alongside, same era.
Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching. In Graph-Based Representations in Pattern Recognition , Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 102–111
CSI_GED: An efficient approach for graph edit similarity computation. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE) . IEEE, 265–276
Karam Gouda and Mosab Hassaan. 2016 · 2016
Later among the works it cites.
Neural Message Passing for Quantum Chemistry
Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. 2017 · 2017
Later among the works it cites.
Sofia Ira Ktena, Sarah Parisot, Enzo Ferrante, Martin Rajchl, Matthew Lee, Ben Glocker, and Daniel Rueckert. 2017 · 2017
Later among the works it cites.
A partitioning algorithm for maximum common subgraph problems
Ciaran McCreesh, Patrick Prosser, and James Trimble. 2017 · 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 · 2011
Cited alongside, same era.
An efficient graph indexing method. In 2012 IEEE 28th International Conference on Data Engineering . IEEE, 210–221
Xiaoli Wang, Xiaofeng Ding, Anthony KH Tung, Shanshan Ying, and Hai Jin. 2012 · 2012
Cited alongside, same era.
Discovering patterns in social networks with graph matching algorithms. In International Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction . Springer, 341–349
Kirk Ogaard, Heather Roy, Sue Kase, Rakesh Nagi, Kedar Sambhoos, and Moises Sudit. 2013 · 2013
Cited alongside, same era.
A novel software toolkit for graph edit distance computation. In International Workshop on Graph-Based Representations in Pattern Recognition . Springer, 142–151
Kaspar Riesen, Sandro Emmenegger, and Horst Bunke. 2013 · 2013
Cited alongside, same era.
κ \kappa -FuzzyTrust: efficient trust computation for large-scale mobile social networks using a fuzzy implicit social graph
Shuhong Chen, Guojun Wang, and Weijia Jia. 2015 · 2015
Cited alongside, same era.
Deep graph kernels. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 1365–1374
Pinar Yanardag and SVN Vishwanathan. 2015 · 2015
Cited alongside, same era.
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016 · 2016
Cited alongside, same era.
Fifty years of graph matching, network alignment and network comparison
Frank Emmert-Streib, Matthias Dehmer, and Yongtang Shi. 2016 · 2016
Cited alongside, same era.
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017 · 2017
Later among the works it cites.
Neural network-based graph embedding for cross-platform binary code similarity detection. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . 363–376
Xiaojun Xu, Chang Liu, Qian Feng, Heng Yin, Le Song, and Dawn Song. 2017 · 2017
Later among the works it cites.
Convolutional set matching for graph similarity
Yunsheng Bai, Hao Ding, Yizhou Sun, and Wei Wang. 2018b · 2018
Later among the works it cites.
How Powerful are Graph Neural Networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018 · 2018
Later among the works it cites.
Hierarchical Graph Representation Learning with Differentiable Pooling
Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, and Jure Leskovec. 2018 · 2018
Later among the works it cites.
Junhyun Lee, Inyeop Lee, and Jaewoo Kang. 2019 · 2019
Later among the works it cites.
Memory-Based Graph Networks. In International Conference on Learning Representations
Amir Hosein Khasahmadi, Kaveh Hassani, Parsa Moradi, Leo Lee, and Quaid Morris. 2020 · 2020
Closest in time.
Self-supervised learning: Generative or contrastive
Xiao Liu, Fanjin Zhang, Zhenyu Hou, Zhaoyu Wang, Li Mian, Jing Zhang, and Jie Tang. 2020 · 2020
Closest in time.