Noisy Subgraph Isomorphisms on Multiplex Networks
暂无分享,去创建一个
Hao Li | Andrea L. Bertozzi | Hui Jin | Yanghui Wang | Xie He | A. Bertozzi | Hui-Yu Jin | Xie He | Hao Li | Yanghui Wang
[1] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.
[2] Fred W. DePiero,et al. An algorithm using length-r paths to approximate subgraph isomorphism , 2003, Pattern Recognit. Lett..
[3] Christine Solnon,et al. AllDifferent-based filtering for subgraph isomorphism , 2010, Artif. Intell..
[4] Ambuj K. Singh,et al. Graphs-at-a-time: query language and access methods for graph databases , 2008, SIGMOD Conference.
[5] Andrea L. Bertozzi,et al. Applications of Structural Equivalence to Subgraph Isomorphism on Multichannel Multigraphs , 2019, 2019 IEEE International Conference on Big Data (Big Data).
[6] Jintao Zhang,et al. An efficient graph-mining method for complicated and noisy data with real-world applications , 2011, Knowledge and Information Systems.
[7] Carey E. Priebe,et al. Matched Filters for Noisy Induced Subgraph Detection , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] Anthony K. H. Tung,et al. Comparing Stars: On Approximating Graph Edit Distance , 2009, Proc. VLDB Endow..
[9] Lorenzo Livi,et al. The graph matching problem , 2012, Pattern Analysis and Applications.
[10] Benno Schwikowski,et al. Graph-based methods for analysing networks in cell biology , 2006, Briefings Bioinform..
[11] Horst Bunke,et al. Efficient subgraph matching using topological node feature constraints , 2015, Pattern Recognit..
[12] Andrea L. Bertozzi,et al. Filtering Methods for Subgraph Matching on Multiplex Networks , 2018, 2018 IEEE International Conference on Big Data (Big Data).
[13] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[14] Joseph A. Cottam,et al. Multi-Channel Large Network Simulation Including Adversarial Activity , 2018, 2018 IEEE International Conference on Big Data (Big Data).
[15] Yang Zhang,et al. Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism , 2011 .
[16] FoggiaPasquale,et al. A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs , 2004 .
[17] Anthony K. H. Tung,et al. An Efficient Graph Indexing Method , 2012, 2012 IEEE 28th International Conference on Data Engineering.
[18] Mario Vento,et al. A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[19] Vincenzo Bonnici,et al. On the Variable Ordering in Subgraph Isomorphism Algorithms , 2017, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[20] Wei Wang,et al. Graph Database Indexing Using Structured Graph Decomposition , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[21] Kaspar Riesen,et al. Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.
[22] Cristina G. Fernandes,et al. Motif Search in Graphs: Application to Metabolic Networks , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[23] Volkmar Frinken,et al. Approximation of graph edit distance based on Hausdorff matching , 2015, Pattern Recognit..
[24] Alessia Saggese,et al. Introducing VF3: A New Algorithm for Subgraph Isomorphism , 2017, GbRPR.
[25] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[26] Philip S. Yu,et al. Substructure similarity search in graph databases , 2005, SIGMOD '05.