{"id":"https://openalex.org/W2127504539","doi":"https://doi.org/10.1145/1498759.1498836","title":"Speeding up algorithms on compressed web graphs","display_name":"Speeding up algorithms on compressed web graphs","publication_year":2009,"publication_date":"2009-02-09","ids":{"openalex":"https://openalex.org/W2127504539","doi":"https://doi.org/10.1145/1498759.1498836","mag":"2127504539"},"language":"en","primary_location":{"id":"doi:10.1145/1498759.1498836","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498759.1498836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Second ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035204666","display_name":"Chinmay Karande","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chinmay Karande","raw_affiliation_strings":["Georgia Inst. Technology, Atlanta, GA"],"affiliations":[{"raw_affiliation_string":"Georgia Inst. Technology, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010424987","display_name":"Kumar Chellapilla","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kumar Chellapilla","raw_affiliation_strings":["Microsoft Live Labs, Bellevue, WA","Microsoft Live Labs, Bellevue, WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Live Labs, Bellevue, WA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Live Labs, Bellevue, WA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007626895","display_name":"Reid Andersen","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Reid Andersen","raw_affiliation_strings":["Microsoft Live Labs, Bellevue, WA","Microsoft Live Labs, Bellevue, WA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Live Labs, Bellevue, WA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Live Labs, Bellevue, WA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035204666"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":2.1635,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.88747847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"272","last_page":"281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7828983068466187},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6597468852996826},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6151610016822815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5595142841339111},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49823856353759766},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.412725031375885},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.3715391457080841}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7828983068466187},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6597468852996826},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6151610016822815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5595142841339111},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49823856353759766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.412725031375885},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3715391457080841}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1498759.1498836","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498759.1498836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Second ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1529464143","https://openalex.org/W1598140737","https://openalex.org/W1854214752","https://openalex.org/W1972978715","https://openalex.org/W1978024959","https://openalex.org/W1994727615","https://openalex.org/W2000273502","https://openalex.org/W2023401026","https://openalex.org/W2066636486","https://openalex.org/W2069153192","https://openalex.org/W2084309732","https://openalex.org/W2089199911","https://openalex.org/W2100081831","https://openalex.org/W2116207470","https://openalex.org/W2124168655","https://openalex.org/W2138621811","https://openalex.org/W2139146018","https://openalex.org/W2151626491","https://openalex.org/W4365806327"],"related_works":["https://openalex.org/W2948148442","https://openalex.org/W2461250372","https://openalex.org/W2394342941","https://openalex.org/W2169853506","https://openalex.org/W2547124190","https://openalex.org/W2350586049","https://openalex.org/W2385628723","https://openalex.org/W2057878850","https://openalex.org/W2169871401","https://openalex.org/W3008492011"],"abstract_inverted_index":{"A":[0],"variety":[1,102],"of":[2,14,29,56,80,97,103,133],"lossless":[3],"compression":[4,23,153],"schemes":[5],"have":[6,114],"been":[7,115],"proposed":[8],"to":[9,35,63],"reduce":[10],"the":[11,45,78,81,86,95,131,152],"storage":[12],"requirements":[13],"web":[15,57,141],"graphs.":[16],"One":[17],"successful":[18],"approach":[19],"is":[20],"virtual":[21,36,67],"node":[22,68],"[7],":[24],"in":[25],"which":[26],"often-used":[27],"patterns":[28],"links":[30,34],"are":[31],"replaced":[32],"by":[33],"nodes,":[37],"creating":[38],"a":[39,101],"compressed":[40,69,82],"graph":[41,58,83,120,142],"that":[42,52,72,149],"succinctly":[43],"represents":[44],"original.":[46,87],"In":[47],"this":[48],"paper,":[49],"we":[50],"show":[51],"several":[53,138],"important":[54],"classes":[55],"algorithms":[59,90,104,121,136],"can":[60],"be":[61],"extended":[62],"run":[64],"directly":[65],"on":[66,77,106,137],"graphs,":[70],"such":[71],"their":[73],"running":[74],"times":[75],"depend":[76],"size":[79,96],"rather":[84],"than":[85],"These":[88],"include":[89],"for":[91,118],"link":[92],"analysis,":[93],"estimating":[94],"vertex":[98],"neighborhoods,":[99],"and":[100,109,125,144],"based":[105],"matrix-vector":[107],"products":[108],"random":[110],"walks.":[111],"Similar":[112],"speed-ups":[113],"obtained":[116],"previously":[117],"classical":[119],"like":[122],"shortest":[123],"paths":[124],"maximum":[126],"bipartite":[127],"matching.":[128],"We":[129],"measure":[130],"performance":[132],"our":[134],"modified":[135],"publicly":[139],"available":[140],"datasets,":[143],"demonstrate":[145],"significant":[146],"empirical":[147],"speedups":[148],"nearly":[150],"match":[151],"ratios.":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":20},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}