Experimental Clarification of Some Issues in Subgraph Isomorphism Algorithms
暂无分享,去创建一个
[1] Jiawei Han,et al. On graph query optimization in large networks , 2010, Proc. VLDB Endow..
[2] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.
[3] Jeong-Hoon Lee,et al. Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases , 2013, SIGMOD '13.
[4] Junhu Wang,et al. Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs , 2015, Proc. VLDB Endow..
[5] Ambuj K. Singh,et al. Query Language and Access Methods for Graph Databases , 2010, Managing and Mining Graph Data.
[6] Alessia Saggese,et al. Introducing VF3: A New Algorithm for Subgraph Isomorphism , 2017, GbRPR.
[7] Jeong-Hoon Lee,et al. An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases , 2012, Proc. VLDB Endow..
[8] Wilfred Ng,et al. Fg-index: towards verification-free query processing on graph databases , 2007, SIGMOD '07.
[9] Philip S. Yu,et al. Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.
[10] Mario Vento,et al. A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Dennis Shasha,et al. GraphGrep: A fast and universal method for querying graphs , 2002, Object recognition supported by user interaction for service robots.
[12] Philip S. Yu,et al. Graph Indexing: Tree + Delta >= Graph , 2007, VLDB.
[13] Jianzhong Li,et al. Efficient Subgraph Matching on Billion Node Graphs , 2012, Proc. VLDB Endow..
[14] Ambuj K. Singh,et al. Closure-Tree: An Index Structure for Graph Queries , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[15] Jeffrey Xu Yu,et al. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism , 2008, Proc. VLDB Endow..