共 17 条
[1]
[Anonymous], 2011, P 2011 ACM SIGMOD IN
[2]
[Anonymous], 1979, Computers and intractability
[3]
[Anonymous], 1989, COMMUNICATION CONCUR
[4]
Efficient Subgraph Matching by Postponing Cartesian Products
[J].
SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA,
2016,
:1199-1214
[5]
Neighbor-Aware Search for Approximate Labeled Graph Matching using the Chi-Square Statistics
[J].
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17),
2017,
:1281-1290
[6]
Graph Pattern Matching: From Intractable to Polynomial Time
[J].
PROCEEDINGS OF THE VLDB ENDOWMENT,
2010, 3 (01)
:264-275
[7]
Fan WF, 2011, PROC INT CONF DATA, P39, DOI 10.1109/ICDE.2011.5767858
[8]
Han W.-S., 2013, P 2013 ACM SIGMOD IN, P337, DOI DOI 10.1145/2463676.2465300
[9]
NeMa: Fast Graph Search with Label Similarity
[J].
PROCEEDINGS OF THE VLDB ENDOWMENT,
2013, 6 (03)
:181-192
[10]
Strong Simulation: Capturing Topology in Graph Pattern Matching
[J].
ACM TRANSACTIONS ON DATABASE SYSTEMS,
2014, 39 (01)