{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:10:18Z","timestamp":1741133418283,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201486"},{"type":"electronic","value":"9783642201493"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20149-3_40","type":"book-chapter","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T22:41:56Z","timestamp":1302302516000},"page":"558-569","source":"Crossref","is-referenced-by-count":4,"title":["Social Based Layouts for the Increase of Locality in Graph Operations"],"prefix":"10.1007","author":[{"given":"Arnau","family":"Prat-P\u00e9rez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Dominguez-Sal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep L.","family":"Larriba-Pey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Al-Furaih, I., Ranka, S.: Memory hierarchy management for iterative graph structures. In: IPPS\/SPDP, pp. 298\u2013302 (1998)","DOI":"10.1109\/IPPS.1998.669929"},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R. Angles","year":"2008","unstructured":"Angles, R., Guti\u00e9rrez, C.: Survey of graph database models. ACM Comput. Surv.\u00a040(1), 1\u201339 (2008)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"40_CR3","first-page":"101","volume":"6","author":"S. Barnard","year":"1994","unstructured":"Barnard, S., Simon, H.: Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. CPE\u00a06(2), 101\u2013117 (1994)","journal-title":"CPE"},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/s00453-002-0969-2","volume":"34","author":"S. Baswana","year":"2002","unstructured":"Baswana, S., Sen, S.: Planar graph blocking for external searching. Algorithmica\u00a034(3), 298\u2013308 (2002)","journal-title":"Algorithmica"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-45749-6_16","volume-title":"Algorithms - ESA 2002","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M.: Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 139\u2013151. Springer, Heidelberg (2002)"},{"issue":"2","key":"40_CR6","first-page":"131","volume":"20","author":"B.J. Mirza","year":"2003","unstructured":"Mirza, B.J., Keller, B.J., Ramakrishnan, N.: Studying recommendation algorithms by graph analysis. JIIS\u00a020(2), 131\u2013160 (2003)","journal-title":"JIIS"},{"issue":"24","key":"40_CR7","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1093\/bioinformatics\/btp595","volume":"25","author":"K. Brown","year":"2009","unstructured":"Brown, K., Otasek, D., Ali, M., McGuffin, M., Xie, W., Devani, B., van Toch, I.L., Jurisica, I.: Navigator: Network analysis, visualization and graphing toronto. Bioinformatics\u00a025(24), 3327\u20133329 (2009)","journal-title":"Bioinformatics"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E\u00a070(6) (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/800195.805928","volume-title":"Proceedings of the 1969 24th National Conference","author":"E. Cuthill","year":"1969","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference, pp. 157\u2013172. ACM, New York (1969)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW, pp. 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-39923-0_12","volume-title":"Spatial Information Theory. Foundations of Geographic Information Science","author":"M. Duckham","year":"2003","unstructured":"Duckham, M., Kulik, L.: Simplest Paths: Automated Route Selection for Navigation. In: Kuhn, W., Worboys, M.F., Timpf, S. (eds.) COSIT 2003. LNCS, vol.\u00a02825, pp. 169\u2013185. Springer, Heidelberg (2003)"},{"key":"40_CR12","unstructured":"Facebook: Press room - statistics, http:\/\/www.facebook.com\/press\/info.php?statistics (Last retrieved in January 2010)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Flake, G., Lawrence, S., Giles, C.: Efficient identification of web communities. In: KDD, pp. 150\u2013160 (2000)","DOI":"10.1145\/347090.347121"},{"issue":"3","key":"40_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"G. Flake","year":"2002","unstructured":"Flake, G., Lawrence, S., Giles, C., Coetzee, F.: Self-organization and identification of web communities. IEEE Computer\u00a035(3), 66\u201371 (2002)","journal-title":"IEEE Computer"},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"N. Gibbs","year":"1976","unstructured":"Gibbs, N., Poole, J., Stockmeyer, P.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis\u00a013(2), 236\u2013250 (1976)","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"12","key":"40_CR16","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. PNAS\u00a099(12), 7821\u20137826 (2002)","journal-title":"PNAS"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"G\u00f3mez-Villamor, S., Soldevila-Miranda, G., Gim\u00e9nez-Va\u00f1\u00f3, A., Mart\u00ednez-Bazan, N., Munt\u00e9s-Mulero, V., Larriba-Pey, J.: Bibex: a bibliographic exploration tool based on the dex graph query engine. In: EDBT, pp. 735\u2013739 (2008)","DOI":"10.1145\/1352431.1352527"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Han, H., Tseng, C.: Exploiting locality for irregular scientific codes. TPDS, 606\u2013618 (2006)","DOI":"10.1109\/TPDS.2006.88"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Ino, H., Kudo, M., Nakamura, A.: Partitioning of web graphs by community topology. In: WWW, pp. 661\u2013669 (2005)","DOI":"10.1145\/1060745.1060841"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Ivanciuc, O., Balaban, A.: Graph theory in chemistry. In: The Encyclopedia of Computational Chemistry, pp. 1169\u20131190 (1998)","DOI":"10.1002\/0470845015.cga008"},{"key":"40_CR21","first-page":"1","volume-title":"SNA-KDD","author":"K. Musia\u0142","year":"2009","unstructured":"Musia\u0142, K., Kazienko, P., Br\u00f3dka, P.: User position measures in social networks. In: SNA-KDD, pp. 1\u20139. ACM, New York (2009)"},{"key":"40_CR22","unstructured":"Karypis, G., Kumar, V.: METIS: Unstructured graph partitioning and sparse matrix ordering system, vol.\u00a02. The University of Minnesota (1995)"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. PRE\u00a078(4) (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Statistical properties of community structure in large social and information networks. In: World Wide Web Conference, pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Bazan, N., Munt\u00e9s-Mulero, V., G\u00f3mez-Villamor, S., Nin, J., S\u00e1nchez-Mart\u00ednez, M., Larriba-Pey, J.: Dex: high-performance exploration on large graphs for information retrieval. In: CIKM, pp. 573\u2013582 (2007)","DOI":"10.1145\/1321440.1321521"},{"issue":"2","key":"40_CR26","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M. Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069(2), 026113 (2004)","journal-title":"Physical Review E"},{"key":"40_CR27","first-page":"1","volume":"9","author":"R. Niewiadomski","year":"2004","unstructured":"Niewiadomski, R., Amaral, J.N., Holte, R.: A performance study of data layout techniques for improving data locality in refinement-based pathfinding. JEA\u00a09, 1\u20132 (2004)","journal-title":"JEA"},{"key":"40_CR28","unstructured":"Oprofile: Oprofile documentation, http:\/\/oprofile.sourceforge.net\/docs\/ (Last retrieved in January 2010)"},{"key":"40_CR29","doi-asserted-by":"crossref","unstructured":"Padrol-Sureda, A., Perarnau-Llobet, G., Pfeifle, J., Munt\u00e9s-Mulero, V.: Overlapping community search for social networks. In: ICDE, pp. 992\u2013995 (2010)","DOI":"10.1109\/ICDE.2010.5447860"},{"issue":"7043","key":"40_CR30","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"3","key":"40_CR31","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.: The np-completeness of the bandwidth minimization problem. Computing\u00a016(3), 263\u2013270 (1976)","journal-title":"Computing"},{"issue":"9","key":"40_CR32","first-page":"769","volume":"15","author":"J. Park","year":"2004","unstructured":"Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. IEEE TPDS\u00a015(9), 769\u2013782 (2004)","journal-title":"IEEE TPDS"},{"key":"40_CR33","doi-asserted-by":"crossref","unstructured":"Phillips, C., Swiler, L.: A graph-based system for network-vulnerability analysis. In: NSPW, pp. 71\u201379 (1998)","DOI":"10.1145\/310889.310919"},{"key":"40_CR34","doi-asserted-by":"crossref","unstructured":"Prat-P\u00e9rez, A.: Master thesis: Social based layouts for the increase of locality in graph operations (2010), http:\/\/www.dama.upc.edu","DOI":"10.1007\/978-3-642-20149-3_40"},{"key":"40_CR35","doi-asserted-by":"crossref","unstructured":"Barnard, S.T., Pothen, A., Simon, H.D.: A spectral algorithm for envelope reduction of sparse matrices. In: SC, pp. 493\u2013502 (1993)","DOI":"10.1145\/169627.169790"},{"issue":"4","key":"40_CR36","first-page":"305","volume":"2","author":"J. Vitter","year":"2006","unstructured":"Vitter, J.: Algorithms and data structures for external memory. FTTCS\u00a02(4), 305\u2013474 (2006)","journal-title":"FTTCS"},{"key":"40_CR37","doi-asserted-by":"crossref","unstructured":"Wilson, P., Lam, M., Moher, T.: Effective \u201cstatic-graph\u201d reorganization to improve locality in garbage-collected systems. In: PLDI, pp. 177\u2013191 (1991)","DOI":"10.1145\/113446.113461"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20149-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T23:57:32Z","timestamp":1741132652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20149-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201486","9783642201493"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20149-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}