| [1] |
ANGEL A , KOUDAS N , SARKAS N ,et al. Dense subgraph maintenance under streaming edge weight updates for realtime story identification[J]. VLDB Journal, 2014,23(2): 175-199.
|
| [2] |
SAKAKI T , . Earthquake shakes Twitter users:real-time event detection by social sensors[C]// The 19th International Conference on World Wide Web,April 26-30,2010,Raleigh,USA. New York:ACM Press, 2010: 851-860.
|
| [3] |
TOSHNIWAL A , TANEJA S , SHUKLA A ,et al. Storm@Twitter[C]// The 2014ACM SIGMOD International Conference on Management of Data,June 22-27,2014,Snowbird,USA. New York:ACM Press, 2014: 147-156.
|
| [4] |
BAR-YOSSEFF Z , KUMART R , SIVAKUMAR D . Reductions in streaming algorithms,with an application to counting triangles in graphs[C]// The 13th Annual ACM-SIAM Symposium on Discrete Algorithms,January 6-8,2002,San Francisco,USA. Philadelphia:Society for Industrial and Applied Mathematics, 2002: 623-632.
|
| [5] |
JOWHARI H , GHODSI M . New streaming algorithms for counting triangles in graphs[C]// The 11th Annual International Conference,August 16-19,2005,Kunming,China.[S.l.:s.n]. 2005: 710-716.
|
| [6] |
BURIOL L S , FRAHLING G , LEONARDI S ,et al. Counting triangles in data streams[C]// The 25th ACM SIGMODSIGACT-SIGART Symposium on Principles of Database Systems,June 26-28,2006,Chicago,USA. New York:ACM Press, 2006: 253-262.
|
| [7] |
UNEL G , FISCHER F , BISHOP B . Answering reachability queries on streaming graphs[C]// The 1st International Workshop Stream Reasoning,May 31,2009,Heraklion,Greece.[S.l.:s.n]. 2009.
|
| [8] |
DEMETRESCU C , FINOCCHI I , RIBICHINI A . Trading off space for passes in graph streaming problems[J]. ACM Transactions on Algorithms, 2006,6(1): 1-17.
|
| [9] |
MCGREGOR A . Graph stream algorithms:a survey[J]. ACM SIGMOD Record, 2014,43(1): 9-20.
|
| [10] |
SONG C Y , GE T , CHEN C ,et al. Event pattern matching over graph streams[J]. Proceedings of the VLDB Endowment, 2014,8(4): 413-424.
|
| [11] |
FAN W F , WANG X , WU Y ,et al. Incremental graph pattern matching[J]. ACM Transactions on Database Systems, 2013,38(3): 925-936.
|
| [12] |
CHOUDHURY S , HOLDER L , CHIN G ,et al. A selectivity based approach to continuous pattern detection in streaming graphs[J]. Computer Science, 2015,93(8): 939-945.
|
| [13] |
AGGARWAL C C , LI Y , YU P S ,et al. On dense pattern mining in graph streams[J]. Proceedings of the VLDB Endowment, 2010,3(1-2): 975-984.
|
| [14] |
VALARI E , KONTAKI M , PAPADOPOULOS A N . Discovery of top-k dense subgraphs in dynamic graph collections[C]// The 24th International Conference on Scientific and Statistical Database Management,June 25-27,2012,Chania,Greece. Heidelberg:Springer, 2012: 213-230.
|
| [15] |
CHI Y , WANG H , YU P S ,et al. Moment:Maintaining closed frequent itemsets over a stream sliding window[C]// The 4th IEEE International Conference on Data Mining,November 1-4,2004,Brighton,UK. Piscataway:IEEE Press, 2004: 59-66.
|
| [16] |
SOLOMON M M . Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987,35(2): 254-265.
|
| [17] |
RODITTY L , ZWICK U . A fully dynamic reachability algorithm for directed graphs with an almost linear update time[J]. SIAM Journal on Computing, 2016,45(3): 712-733.
|
| [18] |
SCHANK T , WAGNER D . Finding,counting and listing all triangles in large graphs,an experimental study[C]// The 36th Annual ACM Symposium on Theory of Computing,June 13-16,2004,Chicago,USA. Heidelberg:Springer, 2005: 606-609.
|
| [19] |
KOLOUNTZAKIS M N , MILLER G L , PENG R ,et al. Efficient triangle counting in large graphs via degree-based vertex partitioning[J]. Internet Mathematics, 2012,8(1-2): 161-185.
|
| [20] |
ZILIASKOPOULOS A K , MAHMASSANI H S . Time dependent,shortest-path algorithm for real-time intelligent vehicle highway system applications[J]. Transportation Research Record, 1993(1408): 94-100.
|
| [21] |
CLIMACO J C N , MARTINS E Q V . A bicriterion shortest path algorithm[J]. European Journal of Operational Research, 1982,11(4): 399-404.
|
| [22] |
YUAN Y , WANG G , WANG H ,et al. Efficient subgraph search over large uncertain graphs[J]. Proceedings of the VLDB Endowment, 2011,4(11): 876-886.
|
| [23] |
YAN X , HAN J . gSpan:graph-based substructure pattern mining[C]// The 2002 IEEE International Conference on Data Mining,December 9-12,2002,Maebashi City,Japan. Piscataway:IEEE Press, 2002: 721-724.
|
| [24] |
KASHIMA H , INOKUCHI A . Kernels for graph classification[C]// The 2002 IEEE International Conference on Data Mining,December 9-12,2002,Maebashi City,Japan.Piscataway:IEEE Press,2002.Maebashi City,Japan. Piscataway:IEEE Press, 2002.
|
| [25] |
SCHAEFFER S E . Graph clustering[J]. Computer Science Review, 2007,1(1): 27-64.
|
