{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:59:35Z","timestamp":1775638775218,"version":"3.50.1"},"reference-count":32,"publisher":"Internet Mathematics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Internet Mathematics"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1080\/15427951.2009.10390641","type":"journal-article","created":{"date-parts":[[2011,3,10]],"date-time":"2011-03-10T03:31:01Z","timestamp":1299727861000},"page":"257-283","source":"Crossref","is-referenced-by-count":30,"title":["Permuting Web and Social Graphs"],"prefix":"10.24166","volume":"6","author":[{"given":"Paolo","family":"Boldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10257","reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Adler, Micah and Mitzenmacher, Michael. \u201cTowards Compressing Web Graphs.\u201d. DCC '01: Proceedings of the Data Compression Conference. pp.203\u2013212. Washington, DC: IEEE Computer Society. [Adler and Mitzenmacher 01]","DOI":"10.1109\/DCC.2001.917151"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.3390\/a2031031"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Asano, Yasuhito, Ito, Tsuyoshi, Imai, Hiroshi, Toyoda, Masashi and Kitsuregawa, Masaru. \u201cCompact Encoding of the Web Graph Exploiting Various Power Laws (Statistical Reason behind Link Database).\u201d. Advances in Web-Age Information Management: 4th International Conference, WAIM 2003. August17\u2013192003, Chengdu, China. pp.37\u201346. New York: Springer. Proceedings, Lecture Notes in Computer Science 2762, [Asano et al. 03]","DOI":"10.1007\/978-3-540-45160-0_5"},{"key":"CIT0004","doi-asserted-by":"crossref","unstructured":"Asano, Yasuhito, Miyawaki, Yuya and Nishizeki, Takao. \u201cEffcient Compression of Web Graphs.\u201d. Computing and Combinatorics: 14th Annual International Conference, COCOON 2008. June27\u2013292008, Dalian, China. pp.1\u201311. New York: Springer. Proceedings, Lecture Notes in Computer Science 5092, [Asano et al. 08]","DOI":"10.1007\/978-3-540-69733-6_1"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)80047-0"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"Blanco, Roi and Barreiro, Alvaro. \u201cDocument Identifier Reassignment through Dimensionality Reduction.\u201d. Advances in Information Retrieval: 27th European Conference on IR Research, ECIR 2005, Santiago de Compostela. March21\u2013232005, Spain. Edited by: Losada, David E. and Fern\u00e1ndez-Luna, Juan M. pp.375\u2013387. New York: Springer. Proceedings Lecture Notes in Computer Science 3408, [Blanco and Barreiro 05]","DOI":"10.1007\/978-3-540-31865-1_27"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Blandford, Daniel K. and Blelloch, Guy E. \u201cIndex Compression through Document Reordering.\u201d. Proceedings of the Data Compression Conference 2002. pp.342\u2013351. Washington, DC: IEEE Computer Society. [Blandford and Blelloch 02]","DOI":"10.1109\/DCC.2002.999972"},{"key":"CIT0008","unstructured":"Blandford, Daniel K., Blelloch, Guy E. and Kash, Ian A. \u201cCompact Representations of Separable Graphs.\u201d. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. pp.579\u2013688. New York: ACM Press. [Blandford et al. 03]"},{"key":"CIT0009","unstructured":"Boldi, Paolo and Vigna, Sebastiano. \u201cThe WebGraph Framework I: Compression Techniques.\u201d. Proceedings of the Thirteenth International World Wide Web Conference. pp.595\u2013601. New York: ACM Press. [Boldi and Vigna 04]"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129113"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Boldi, Paolo, Santini, Massimo and Vigna, Sebastiano. \u201cPermuting Web Graphs.\u201d. Algorithms and Models for the Web-Graph: 6th International Workshop, WAW 2009. February12\u2013132009, Barcelona, Spain. pp.116\u2013126. New York: Springer. Proceedings, Lecture Notes in Computer Science 5427, [Boldi et al. 09]","DOI":"10.1007\/978-3-540-95995-3_10"},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"Brisaboa, Nieves R., Ladra, Susana and Navarro, Gonzalo. \u201ck2-Trees for Compact Web Graph Representation.\u201d. String Processing and Information Retrieval: 16th International Symposium, SPIRE 2009. August25\u2013272009, Saariselk, Finland. pp.18\u201330. New York: Springer. Proceedings, Lecture Notes in Computer Science 5721, [Brisaboa et al. 09]","DOI":"10.1007\/978-3-642-03784-9_3"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Buehrer, Gregory and Chellapilla, Kumar. \u201cA Scalable Pattern Mining Approach to Web Graph Compression with Communities.\u201d. WSDM '08: Proceedings of the International Conference on Web Search and Web Data Mining. pp.95\u2013106. New York: ACM. [Buehrer and Chellapilla 08]","DOI":"10.1145\/1341531.1341547"},{"key":"CIT0014","unstructured":"Chierichetti, Flavio, Kumar, Ravi, Lattanzi, Silvio, Mitzenmacher, Michael, Panconesi, Alessandro and Raghavan, Prabhakar. \u201cOn Compressing Social Networks.\u201d. KDD '09: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp.219\u2013228. New York: ACM. [Chierichetti et al. 09]"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Claude, Francisco and Navarro, Gonzalo. \u201cA Fast and Compact Web Graph Representation.\u201d. String Processing and Information Retrieval: 14th International Symposium, SPIRE 2007. October29\u2013312007, Santiago, Chile. pp.118\u2013129. New York: Springer. Proceedings, Lecture Notes in Computer Science 4726, [Claude and Navarro 07]","DOI":"10.1007\/978-3-540-75530-2_11"},{"key":"CIT0016","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"Elias Peter","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1145\/1083784.1083791"},{"key":"CIT0018","volume-title":"\u201cOn the Number of Bits Required to Implement an Associative Memory.\u201d","author":"Fano Robert M.","year":"1971"},{"key":"CIT0019","doi-asserted-by":"crossref","unstructured":"Guillaume, Jean-Loup, Latapy, Matthieu and Viennot, Laurent. \u201cEfficient and Simple Encodings for the Web Graph.\u201d. Advances in Web-Age Information Management: WAIM '02: Third International Conference, WAIM 2002. August11\u2013132002, Beijing, China. pp.328\u2013337. New York: Springer. Proceedings, [Guillaume et al. 02]","DOI":"10.1007\/3-540-45703-8_30"},{"key":"CIT0020","unstructured":"Jacobson, Guy. \u201cSpace-Effcient Static Trees and Graphs.\u201d. 30th Annual Symposium on Foundations of Computer Science. pp.549\u2013554. Research Triangle Park, NC: IEEE. [Jacobson 89]"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Karande, Chinmay, Chellapilla, Kumar and Andersen, Reid. \u201cSpeeding Up Algorithms on Compressed Web Graphs.\u201d. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining. pp.272\u2013281. New York: ACM. [Karande et al. 09]","DOI":"10.1145\/1498759.1498836"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"CIT0023","volume-title":"The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations","author":"Knuth Donald E.","year":"2005"},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Kumar, Ravi, Raghavan, Prabhakar, Rajagopalan, Sridhar, Sivakumar, D., Tompkins, Andrew and Upfal, Eli. \u201cThe Web as a Graph.\u201d. PODS '00: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. pp.1\u201310. New York: ACM Press. [Kumar et al. 00]","DOI":"10.1145\/335168.335170"},{"key":"CIT0025","unstructured":"Jesper Larsson, N. and Moffat, Alistair. \u201cOffline Dictionary-Based Compression.\u201d. DCC '99: Proceedings of the Conference on Data Compression. pp.296\u2013305. Washington, DC: IEEE. [Larsson and Moffat 99]"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90011-Z"},{"key":"CIT0027","unstructured":"Raghavan, Sriram and Garcia-Molina, Hector. \u201cRepresenting Web Graphs.\u201d. Proceedings of the 19th International Conference on Data Engineering, 2003. pp.405\u2013416. Washington, DC: IEEE. [Raghavan and Garcia-Molina 03]"},{"key":"CIT0028","unstructured":"Randall, Keith H., Stata, Raymie, Wiener, Janet L. and Wickremesinghe, Rajiv G. \u201cThe Link Database: Fast Access to Graphs of the Web.\u201d. Proceedings of the Data Compression Conference 2002. pp.122\u2013131. Washington, DC: IEEE. [Randall et al. 02]"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(02)00020-1"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"Silvestri, Fabrizio. \u201cSorting Out the Document Identifier Assignment Problem.\u201d. Advances in Information Retrieval: 29th European Conference on IR Research, ECIR 2007. April2\u201352007, Rome, Italy. Edited by: Amati, Giambattista, Carpineto, Claudio and Romano, Giovanni. pp.101\u2013112. New York: Springer. Proceedings, Lecture Notes in Computer Science 4425, [Silvestri 07]","DOI":"10.1007\/978-3-540-71496-5_12"},{"key":"CIT0031","doi-asserted-by":"crossref","unstructured":"Suel, Torsten and Yuan, Jun. \u201cCompressing the Graph Structure of the Web.\u201d. Proceedings of the Data Compression Conference 2001. pp.213\u2013222. Washington, DC: IEEE. [Suel and Yuan 01]","DOI":"10.1109\/DCC.2001.917152"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90126-4"}],"container-title":["Internet Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/15427951.2009.10390641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T23:58:25Z","timestamp":1741046305000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.internetmathematicsjournal.com\/article\/1484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1080\/15427951.2009.10390641"],"URL":"https:\/\/doi.org\/10.1080\/15427951.2009.10390641","relation":{},"ISSN":["1542-7951","1944-9488"],"issn-type":[{"value":"1542-7951","type":"print"},{"value":"1944-9488","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}