{"id":"https://openalex.org/W2557693874","doi":"https://doi.org/10.1109/hpec.2016.7761608","title":"A scale-free structure for power-law graphs","display_name":"A scale-free structure for power-law graphs","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2557693874","doi":"https://doi.org/10.1109/hpec.2016.7761608","mag":"2557693874"},"language":"en","primary_location":{"id":"doi:10.1109/hpec.2016.7761608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2016.7761608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE High Performance Extreme Computing Conference (HPEC)","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/A5011290316","display_name":"Richard Veras","orcid":"https://orcid.org/0000-0003-2633-3391"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard Veras","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019607600","display_name":"Tze Meng Low","orcid":"https://orcid.org/0000-0002-5179-8249"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tze Meng Low","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062806943","display_name":"Franz Franchetti","orcid":"https://orcid.org/0000-0002-3529-8973"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Franz Franchetti","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011290316"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.52,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73933414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"11","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9993000030517578,"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.9983999729156494,"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"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.7884519696235657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7359805107116699},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.615381121635437},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5918170213699341},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5320112705230713},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49374112486839294},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4633086025714874},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4229186475276947},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2358982264995575},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21580776572227478},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08984020352363586}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7884519696235657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7359805107116699},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.615381121635437},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5918170213699341},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5320112705230713},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49374112486839294},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4633086025714874},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4229186475276947},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2358982264995575},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21580776572227478},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08984020352363586},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec.2016.7761608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec.2016.7761608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE High Performance Extreme Computing Conference (HPEC)","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":14,"referenced_works":["https://openalex.org/W173739644","https://openalex.org/W1552509329","https://openalex.org/W2047196981","https://openalex.org/W2099625934","https://openalex.org/W2112681514","https://openalex.org/W2117495845","https://openalex.org/W2121821841","https://openalex.org/W2126004407","https://openalex.org/W2137613189","https://openalex.org/W2539828367","https://openalex.org/W3004555699","https://openalex.org/W6606900510","https://openalex.org/W6633152989","https://openalex.org/W6677111876"],"related_works":["https://openalex.org/W1556451512","https://openalex.org/W1555349535","https://openalex.org/W4234091740","https://openalex.org/W4213350282","https://openalex.org/W2230171082","https://openalex.org/W2583128298","https://openalex.org/W2886568922","https://openalex.org/W4200554539","https://openalex.org/W3006679059","https://openalex.org/W3046940200"],"abstract_inverted_index":{"Many":[0],"real-world":[1,85],"graphs,":[2],"such":[3],"as":[4],"those":[5],"that":[6,20,38],"arise":[7],"from":[8],"the":[9,66,96,99,105,109,118,121],"web,":[10],"biology":[11],"and":[12,16,64,91,107],"transportation,":[13],"appear":[14],"random":[15],"without":[17],"a":[18,34,80,89],"structure":[19,82,97],"can":[21,39],"be":[22,40],"exploited":[23],"for":[24,42,72,83,123],"performance":[25],"on":[26,60],"modern":[27],"computer":[28],"architectures.":[29],"However,":[30],"these":[31,73],"graphs":[32,87,124],"have":[33],"scale-free":[35,86,113],"graph":[36,106,114],"topology":[37],"leveraged":[41],"locality.":[43],"Existing":[44],"sparse":[45,90],"data":[46,75,81,115],"formats":[47],"are":[48],"not":[49],"designed":[50],"to":[51,127],"take":[52],"advantage":[53],"of":[54,68,98,120],"this":[55],"structure.":[56],"They":[57],"focus":[58],"primarily":[59],"reducing":[61],"storage":[62],"requirements":[63],"improving":[65],"cost":[67],"certain":[69],"matrix":[70],"operations":[71],"large":[74],"sets.":[76],"Therefore,":[77],"we":[78,101,116],"propose":[79],"storing":[84],"in":[88,104,108],"hierarchical":[92],"fashion.":[93],"By":[94],"maintaining":[95],"graph,":[100],"preserve":[102],"locality":[103],"cache.":[110],"For":[111],"synthetic":[112],"outperform":[117],"state":[119],"art":[122],"with":[125],"up":[126],"10":[128],"<sup":[129],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[130],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">7</sup>":[131],"non-zero":[132],"edges.":[133]},"counts_by_year":[{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}