{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:34:24Z","timestamp":1758270864696,"version":"3.40.4"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319117485"},{"type":"electronic","value":"9783319117492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11749-2_18","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T02:22:05Z","timestamp":1410402125000},"page":"234-243","source":"Crossref","is-referenced-by-count":3,"title":["Common Neighbor Query-Friendly Triangulation-Based Large-Scale Graph Compression"],"prefix":"10.1007","author":[{"given":"Liang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: Proceedings of the Data Compression Conference, DCC 2001, pp. 203\u2013212. IEEE (2001)","DOI":"10.1109\/DCC.2001.917151"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Blandford, D., Blelloch, G.E.: Index compression through document reordering. In: Proceedings of the Data Compression Conference, DCC 2002, pp. 342\u2013351. IEEE (2002)","DOI":"10.1109\/DCC.2002.999972"},{"key":"18_CR3","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, pp. 595\u2013602. ACM (2004)","DOI":"10.1145\/988672.988752"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 95\u2013106. ACM (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"18_CR5","doi-asserted-by":"publisher","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 Journal of Computer Engineering (IOSR-JCE)\u00a012, 25\u201334 (2013)","journal-title":"IOSR Journal of Computer Engineering (IOSR-JCE)"},{"key":"18_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.\u00a02, pp. 343\u2013346. IEEE (2012)","DOI":"10.1109\/ISCID.2012.237"},{"key":"18_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":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-540-78646-7_62","volume-title":"Advances in Information Retrieval","author":"D. Hannah","year":"2008","unstructured":"Hannah, D., Macdonald, C., Ounis, I.: Analysis of link graph compression techniques. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., White, R.W. (eds.) ECIR 2008. LNCS, vol.\u00a04956, pp. 596\u2013601. Springer, Heidelberg (2008)"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond\u2019caveman communities\u2019: Hubs and spokes for graph compression and mining. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 300\u2013309. IEEE (2011)","DOI":"10.1109\/ICDM.2011.26"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0407(1), 458\u2013473 (2008)","journal-title":"Theoretical Computer Science"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11427186_54","volume-title":"Experimental and Efficient Algorithms","author":"T. Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 606\u2013609. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11749-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T15:41:07Z","timestamp":1746373267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11749-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319117485","9783319117492"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11749-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}