{"id":"https://openalex.org/W3006678260","doi":"https://doi.org/10.1109/bigdata47090.2019.9005704","title":"Algorithms on Compressed Time-Evolving Graphs","display_name":"Algorithms on Compressed Time-Evolving Graphs","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3006678260","doi":"https://doi.org/10.1109/bigdata47090.2019.9005704","mag":"3006678260"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata47090.2019.9005704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata47090.2019.9005704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Big Data (Big Data)","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/A5081811192","display_name":"Michael L. Nelson","orcid":"https://orcid.org/0000-0003-3749-8116"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Nelson","raw_affiliation_strings":["School of Computer Science, University of Oklahoma, Norman, OK, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Oklahoma, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101878770","display_name":"Sridhar Radhakrishnan","orcid":"https://orcid.org/0000-0002-0327-8134"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sridhar Radhakrishnan","raw_affiliation_strings":["School of Computer Science, University of Oklahoma, Norman, OK, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Oklahoma, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026213288","display_name":"Chandra N. Sekharan","orcid":"https://orcid.org/0000-0002-5784-7400"},"institutions":[{"id":"https://openalex.org/I1925986","display_name":"Loyola University Chicago","ror":"https://ror.org/04b6x2g63","country_code":"US","type":"education","lineage":["https://openalex.org/I1925986"]},{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chandra N. Sekharan","raw_affiliation_strings":["Department of Computer Science, Loyola University of Chicago, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Loyola University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I1925986","https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081811192"],"corresponding_institution_ids":["https://openalex.org/I8692664"],"apc_list":null,"apc_paid":null,"fwci":0.28,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67843166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":null,"first_page":"227","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980000257492065,"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/T11478","display_name":"Caching and Content Delivery","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7566367387771606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5417102575302124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4875335395336151},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45142143964767456},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4205642640590668},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41875797510147095},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24904930591583252},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.21495234966278076}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7566367387771606},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5417102575302124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4875335395336151},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45142143964767456},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4205642640590668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41875797510147095},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24904930591583252},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.21495234966278076}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata47090.2019.9005704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata47090.2019.9005704","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1507786189","https://openalex.org/W1746637951","https://openalex.org/W1864844333","https://openalex.org/W1874858905","https://openalex.org/W1965109038","https://openalex.org/W1984196269","https://openalex.org/W1989539826","https://openalex.org/W2017333496","https://openalex.org/W2044040096","https://openalex.org/W2069576934","https://openalex.org/W2075536906","https://openalex.org/W2092403378","https://openalex.org/W2110920860","https://openalex.org/W2127114148","https://openalex.org/W2140232587","https://openalex.org/W2144534163","https://openalex.org/W2202744286","https://openalex.org/W2244843312","https://openalex.org/W2545919726","https://openalex.org/W2751415436","https://openalex.org/W2805674303","https://openalex.org/W2870808032","https://openalex.org/W3037819556","https://openalex.org/W3109089857","https://openalex.org/W3139713485","https://openalex.org/W4294564371","https://openalex.org/W6630360813","https://openalex.org/W6639127530","https://openalex.org/W6743963329","https://openalex.org/W6751807496"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2951468430"],"abstract_inverted_index":{"Time-evolving":[0],"graphs":[1,21,116],"are":[2],"structures":[3],"that":[4],"encapsulate":[5],"how":[6],"a":[7],"graph":[8,60,74,100,128],"changes":[9],"over":[10,43],"time.":[11],"Thus,":[12],"we":[13,31,53,63],"not":[14,77],"only":[15,78],"have":[16],"to":[17,105],"deal":[18],"with":[19],"large":[20],"consisting":[22],"of":[23,36,49,57,69,125],"nodes":[24],"and":[25,41,102,113,133],"edges":[26,39],"in":[27],"the":[28,90,126],"billions,":[29],"but":[30,82],"must":[32,54,76,83],"also":[33,84],"keep":[34],"track":[35],"when":[37],"these":[38],"activate":[40],"deactivate":[42],"long":[44],"lifetimes.":[45],"In":[46,93],"this":[47,94],"age":[48],"big":[50],"historical":[51],"data,":[52],"make":[55],"use":[56],"efficient":[58],"time-evolving":[59,73,99,115],"compressions,":[61],"or":[62],"will":[64],"find":[65],"ourselves":[66],"quickly":[67],"out":[68],"main":[70],"memory.":[71],"These":[72],"compressions":[75],"be":[79],"space":[80],"efficient,":[81],"facilitate":[85],"fast":[86],"querying":[87],"directly":[88,108],"on":[89,109],"compressed":[91,117,127],"graph.":[92],"paper,":[95],"define":[96],"several":[97],"novel":[98],"problems":[101],"develop":[103],"algorithms":[104],"solve":[106],"them":[107],"various,":[110],"massive,":[111],"synthetic":[112],"real-world":[114],"using":[118],"our":[119],"technique.":[120],"Our":[121],"experiments":[122],"provide":[123],"details":[124],"sizes,":[129],"algorithm":[130],"run":[131],"times,":[132],"other":[134],"metrics.":[135]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}