Fetching the paper…
Reading the bibliography…
Detecting the Maximum Common Subgraph (MCS) between two input graphs is fundamental for applications in drug synthesis, malware detection, cloud computing, etc.
Random graphs
Gilbert, E. N · 1959
Earlier work this paper cites.
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
Levi, G · 1973
Earlier work this paper cites.
Two algorithms for constructing a delaunay triangulation
Lee, D.-T. and Schachter, B. J · 1980
Earlier work this paper cites.
Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., and Hansch, C · 1991
Earlier work this paper cites.
A graph distance metric based on the maximal common subgraph
Bunke, H. and Shearer, K · 1998
Earlier work this paper cites.
Collective dynamics of ‘small-world’networks
Watts, D. J. and Strogatz, S. H · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Barabási, A.-L. and Albert, R · 1999
Earlier work this paper cites.
Introducing the enron corpus
Klimt, B. and Yang, Y · 2004
Earlier work this paper cites.
Substructure similarity search in graph databases
Yan, X., Yu, P. S., and Han, J · 2005
Earlier work this paper cites.
Iam graph database repository for graph based pattern recognition and machine learning
Riesen, K. and Bunke, H · 2008
Earlier work this paper cites.
Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms
Vismara, P. and Valery, B · 2008
Earlier work this paper cites.
Comparison of descriptor spaces for chemical compound retrieval and classification
Wale, N., Watson, I. A., and Karypis, G · 2008
Earlier work this paper cites.
Gephi: an open source software for exploring and manipulating networks
Bastian, M., Heymann, S., and Jacomy, M · 2009
Earlier work this paper cites.
Curriculum learning
Bengio, Y., Louradour, J., Collobert, R., and Weston, J · 2009
Earlier work this paper cites.
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
Leskovec, J., Lang, K. J., Dasgupta, A., and Mahoney, M. W · 2009
Earlier work this paper cites.
Comparing stars: On approximating graph edit distance
Zeng, Z., Tung, A. K., Wang, J., Feng, J., and Zhou, L · 2009
Earlier work this paper cites.
Privacy-preserving query over encrypted graph-structured data in cloud computing
Cao, N., Yang, Z., Wang, C., Ren, K., and Lou, W · 2011
Earlier work this paper cites.
Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review
Ehrlich, H.-C. and Rarey, M · 2011
Earlier work this paper cites.
The maximum common edge subgraph problem: A polyhedral investigation
Bahiense, L., Manić, G., Piva, B., and De Souza, C. C · 2012
Cited alongside, same era.
An efficient graph indexing method
Wang, X., Ding, X., Tung, A. K., Ying, S., and Jin, H · 2012
Cited alongside, same era.
Playing atari with deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., and Riedmiller, M · 2013
Cited alongside, same era.
Deriving common malware behavior through graph clustering
Park, Y., Reeves, D. S., and Stamp, M · 2013
Cited alongside, same era.
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
Schietgat, L., Ramon, J., and Bruynooghe, M · 2013
Cited alongside, same era.
A new space for comparing graphs
Shrivastava, A. and Li, P · 2014
Cited alongside, same era.
A simple yet effective baseline for non-attributed graph classification
Cai, C. and Wang, Y · 2018
Later among the works it cites.
Comparison of maximum common subgraph isomorphism algorithms for the alignment of 2d chemical structures
Duesbury, E., Holliday, J., and Willett, P · 2018
Later among the works it cites.
Pitfalls of graph neural network evaluation
Shchur, O., Mumme, M., Bojchevski, A., and Günnemann, S · 2018
Later among the works it cites.
Graph attention networks
Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., and Bengio, Y · 2018
Later among the works it cites.
Deep learning of graph matching
Zanfir, A. and Sminchisescu, C · 2018
Later among the works it cites.
Simgnn: A neural network approach to fast graph similarity computation
Bai, Y., Ding, H., Bian, S., Chen, T., Sun, Y., and Wang, W · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J · 2015
Cited alongside, same era.
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al · 2015
Cited alongside, same era.
Deep graph kernels
Yanardag, P. and Vishwanathan, S · 2015
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Kipf, T. N. and Welling, M · 2016
Cited alongside, same era.
Clique and constraint models for maximum common (connected) subgraph problems
McCreesh, C., Ndiaye, S. N., Prosser, P., and Solnon, C · 2016
Cited alongside, same era.
Gromov-wasserstein averaging of kernel and distance matrices
Peyré, G., Cuturi, M., and Solomon, J · 2016
Cited alongside, same era.
Later among the works it cites.
Learning transferable graph exploration
Dai, H., Li, Y., Wang, C., Singh, R., Huang, P.-S., and Kohli, P · 2019
Later among the works it cites.
Fast graph representation learning with PyTorch Geometric
Fey, M. and Lenssen, J. E · 2019
Later among the works it cites.
Graph matching networks for learning the similarity of graph structured objects
Li, Y., Gu, C., Dullien, T., Vinyals, O., and Kohli, P · 2019
Later among the works it cites.
A learning based branch and bound for maximum common subgraph problems
Liu, Y.-l., Li, C.-m., Jiang, H., and He, K · 2019
Later among the works it cites.
Learning combinatorial embedding networks for deep graph matching
Wang, R., Yan, J., and Yang, X · 2019
Later among the works it cites.
Position-aware graph neural networks
You, J., Ying, R., and Leskovec, J · 2019
Later among the works it cites.
Finding key players in complex networks through deep reinforcement learning
Fan, C., Zeng, L., Sun, Y., and Liu, Y.-Y · 2020
Closest in time.
Hierarchical graph matching networks for deep graph similarity learning, 2020
Ling, X., Wu, L., Wang, S., Ma, T., Xu, F., Wu, C., and Ji, S · 2020
Closest in time.
Constrained combinatorial optimization with reinforcement learning
Solozabal, R., Ceberio, J., and Takáč, M · 2020
Closest in time.
Learning deep graph matching with channel-independent embedding and hungarian attention
Yu, T., Wang, R., Yan, J., and Li, B · 2020
Closest in time.
Analyzing the expressive power of graph neural networks in a spectral perspective
Balcilar, M., Renton, G., Héroux, P., Gaüzère, B., Adam, S., and Honeine, P · 2021
Closest in time.