{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:33Z","timestamp":1750824693196,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319635781"},{"type":"electronic","value":"9783319635798"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63579-8_10","type":"book-chapter","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T05:02:42Z","timestamp":1501650162000},"page":"116-131","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Compression on Real World Directed Graphs"],"prefix":"10.1007","author":[{"given":"Guohua","family":"Li","sequence":"first","affiliation":[]},{"given":"Weixiong","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Zhongxiao","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,3]]},"reference":[{"key":"10_CR1","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":"12","key":"10_CR2","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim, Y., Kang, U., Faloutsos, C.: SlashBurn: graph compression and mining beyond caveman communities. IEEE Trans. Knowl. Data Eng. 26(12), 3077\u20133089 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Shun, J., Dhulipala, L., Blelloch, G.E.: Smaller and faster: parallel processing of compressed graphs with ligra+. In: 2015 Data Compression Conference, DCC 2015, Snowbird, UT, USA, 7\u20139 April 2015, pp. 403\u2013412 (2015)","DOI":"10.1109\/DCC.2015.8"},{"issue":"8","key":"10_CR4","first-page":"716","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning in the cloud. PVLDB 5(8), 716\u2013727 (2012)","journal-title":"PVLDB"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2013, Shenzhen, China, 23\u201327 February 2013, pp. 135\u2013146 (2013)","DOI":"10.1145\/2517327.2442530"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, NY, USA, 22\u201327 June 2013, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large Boolean matrices using reordering techniques. In: (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, 31 August\u20133 September 2004, pp. 13\u201323 (2004)","DOI":"10.1016\/B978-012088469-8\/50005-X"},{"key":"10_CR8","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems. 14th International Conference on Neural Information Processing Systems: Natural and Synthetic, NIPS 2001, Vancouver, British Columbia, Canada, 3\u20138 December 2001, pp. 849\u2013856 (2001)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Davis, J.V., Kulis, B., Jain, P., Sra, S., Dhillon, I.S.: Information-theoretic metric learning. In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, 20\u201324 June 2007, pp. 209\u2013216 (2007)","DOI":"10.1145\/1273496.1273523"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully automatic cross-associations. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, Washington, USA, 22\u201325 August 2004, pp. 79\u201388 (2004)","DOI":"10.1145\/1014052.1014064"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, 28 June\u20131 July 2009, pp. 219\u2013228 (2009)","DOI":"10.1145\/1557019.1557049"},{"key":"10_CR12","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"10_CR13","unstructured":"Shun, J., Dhulipala, L., Blelloch, G.: Tutorial: large-scale graph processing in shared memory. https:\/\/github.com\/jshun\/ligra\/blob\/master\/tutorial\/tutorial.pdf"},{"key":"10_CR14","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":"10_CR15","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework II: codes for the world-wide web. In: 2004 Data Compression Conference (DCC 2004), 23\u201325 March 2004, Snowbird, UT, USA, p. 528 (2004)","DOI":"10.1109\/DCC.2004.1281504"},{"issue":"3","key":"10_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/15427951.2009.10390641","volume":"6","author":"P Boldi","year":"2009","unstructured":"Boldi, P., Santini, M., Vigna, S.: Permuting web and social graphs. Internet Math. 6(3), 257\u2013283 (2009)","journal-title":"Internet Math."},{"issue":"5","key":"10_CR17","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s00778-012-0283-9","volume":"21","author":"U Kang","year":"2012","unstructured":"Kang, U., Tong, H., Sun, J., Lin, C., Faloutsos, C.: GBASE: an efficient analysis platform for large graphs. VLDB J. 21(5), 637\u2013650 (2012)","journal-title":"VLDB J."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Fineman, J.T., Frigo, M., Gilbert, J.R., Leiserson, C.E.: Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. In: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, Calgary, Alberta, Canada, 11\u201313 August 2009, pp. 233\u2013244 (2009)","DOI":"10.1145\/1583991.1584053"},{"key":"10_CR19","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Sparse_matrix"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Nilakant, K., Dalibard, V., Roy, A., Yoneki, E.: PrefEdge: SSD prefetcher for large-scale graph traversal. In: International Conference on Systems and Storage, SYSTOR 2014, Haifa, Israel, 30 June\u201302 July 2014, pp. 4:1\u20134:12 (2014)","DOI":"10.1145\/2611354.2611365"},{"issue":"4","key":"10_CR21","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s13042-014-0286-5","volume":"6","author":"F Nourbakhsh","year":"2015","unstructured":"Nourbakhsh, F., Bul\u00f2, S.R., Pelillo, M.: A matrix factorization approach to graph compression with partial information. Int. J. Mach. Learn. Cybern. 6(4), 523\u2013536 (2015)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: a peta-scale graph mining system. In: The Ninth IEEE International Conference on Data Mining, ICDM 2009, Miami, Florida, USA, 6\u20139 December 2009, pp. 229\u2013238 (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Williams, S., Oliker, L., Demmel, J.: Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication. In: 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16\u201320 May 2011 - Conference Proceedings, pp. 721\u2013733 (2011)","DOI":"10.1109\/IPDPS.2011.73"},{"issue":"10","key":"10_CR24","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1109\/TPDS.2012.290","volume":"24","author":"V Karakasis","year":"2013","unstructured":"Karakasis, V., Gkountouvas, T., Kourtis, K., Goumas, G.I., Koziris, N.: An extended compression format for the optimization of sparse matrix-vector multiplication. IEEE Trans. Parallel Distrib. Syst. 24(10), 1930\u20131940 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, 20\u201324 May 2012, pp. 157\u2013168 (2012)","DOI":"10.1145\/2213836.2213855"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63579-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:55:45Z","timestamp":1750794945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63579-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319635781","9783319635798"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63579-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}