{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:08:59Z","timestamp":1725865739667},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458342"},{"type":"electronic","value":"9783319458359"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45835-9_15","type":"book-chapter","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T13:41:43Z","timestamp":1474465303000},"page":"164-175","source":"Crossref","is-referenced-by-count":1,"title":["Compressing Streaming Graph Data Based on Triangulation"],"prefix":"10.1007","author":[{"given":"Liang","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ming","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Data Compression Conference, DCC 2001, Snowbird, Utah, USA, 27\u201329 March 2001, pp. 203\u2013212 (2001)","DOI":"10.1109\/DCC.2001.917151"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web, WWW 2004, New York, NY, USA, 17\u201320 May 2004, pp. 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, 11\u201312 February 2008, pp. 95\u2013106 (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.9790\/0661-1232534","volume":"12","author":"A Chaturvedi","year":"2013","unstructured":"Chaturvedi, A., Acharjee, T.: An efficient modified common neighbor approach for link prediction in social networks. IOSR J. Comput. Eng. (IOSR-JCE) 12, 25\u201334 (2013)","journal-title":"IOSR J. Comput. Eng. (IOSR-JCE)"},{"issue":"6","key":"15_CR5","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1007\/s10955-013-0749-1","volume":"151","author":"K Choroma\u0144ski","year":"2013","unstructured":"Choroma\u0144ski, K., Matuszak, M., Mikisz, J.: Scale-free graph with preferential attachment and evolving internal vertex structure. J. Stat. Phys. 151(6), 1175\u20131183 (2013)","journal-title":"J. Stat. Phys."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Cui, H.: Link prediction on evolving data using tensor-based common neighbor. In: 2012 Fifth International Symposium on Computational Intelligence and Design (ISCID), vol. 2, pp. 343\u2013346. IEEE (2012)","DOI":"10.1109\/ISCID.2012.237"},{"key":"15_CR7","unstructured":"Gilbert, A.C., Levchenko, K.: Compressing network graphs. In: Proceedings of the LinkKDD Workshop at the 10th ACM Conference on KDD (2004)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond \u2018caveman communities\u2019: hubs and spokes for graph compression and mining. In: 11th IEEE International Conference on Data Mining, ICDM 2011, Vancouver, BC, Canada, 11\u201314 December 2011, pp. 300\u2013309 (2011)","DOI":"10.1109\/ICDM.2011.26"},{"issue":"1","key":"15_CR9","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"McGregor, A.: Graph mining on streams. In: Encyclopedia of Database Systems, pp. 1271\u20131275 (2009)","DOI":"10.1007\/978-0-387-39940-9_184"},{"key":"15_CR11","unstructured":"Smith, A.J.: CPU cache memories. In: SIGMETRICS, p. 219 (1989)"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45835-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T05:16:33Z","timestamp":1601097393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45835-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458342","9783319458359"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45835-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}