{"id":"https://openalex.org/W2890003917","doi":"https://doi.org/10.14778/3275536.3275540","title":"Local algorithms for hierarchical dense subgraph discovery","display_name":"Local algorithms for hierarchical dense subgraph discovery","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2890003917","doi":"https://doi.org/10.14778/3275536.3275540","mag":"2890003917"},"language":"en","primary_location":{"id":"doi:10.14778/3275536.3275540","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3275536.3275540","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1704.00386","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ahmet Erdem Sariy\u00fcce","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmet Erdem Sariy\u00fcce","raw_affiliation_strings":["University at Buffalo Buffalo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Buffalo Buffalo","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":null,"display_name":"C. Seshadhri","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Seshadhri","raw_affiliation_strings":["University of California Santa Cruz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California Santa Cruz","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ali Pinar","orcid":null},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Pinar","raw_affiliation_strings":["Sandia National Laboratories Livermore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories Livermore","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0618,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.88240455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"12","issue":"1","first_page":"43","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.5127000212669373,"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.5127000212669373,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.2071000039577484,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11089999973773956,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computation","display_name":"Computation","score":0.5647000074386597},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5612000226974487},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.49729999899864197},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49079999327659607},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.4609000086784363},{"id":"https://openalex.org/keywords/truss","display_name":"Truss","score":0.45750001072883606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4050999879837036}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5981000065803528},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5647000074386597},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5612000226974487},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.49729999899864197},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49079999327659607},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C173534245","wikidata":"https://www.wikidata.org/wiki/Q1328068","display_name":"Truss","level":2,"score":0.45750001072883606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4519999921321869},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.424699991941452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4050999879837036},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3702000081539154},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2685000002384186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2678000032901764},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2632000148296356}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3275536.3275540","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3275536.3275540","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1704.00386","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.00386","pdf_url":"https://arxiv.org/pdf/1704.00386","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1704.00386","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1704.00386","pdf_url":"https://arxiv.org/pdf/1704.00386","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1576857282","https://openalex.org/W1888346910","https://openalex.org/W1968895412","https://openalex.org/W1971717360","https://openalex.org/W1972558815","https://openalex.org/W1974874717","https://openalex.org/W1988888548","https://openalex.org/W2004336221","https://openalex.org/W2005499394","https://openalex.org/W2023536175","https://openalex.org/W2043521128","https://openalex.org/W2070506828","https://openalex.org/W2072903423","https://openalex.org/W2085426754","https://openalex.org/W2094224753","https://openalex.org/W2121526866","https://openalex.org/W2125895010","https://openalex.org/W2128438887","https://openalex.org/W2142599626","https://openalex.org/W2148606255","https://openalex.org/W2151626491","https://openalex.org/W2152886806","https://openalex.org/W2164053683","https://openalex.org/W2169206507","https://openalex.org/W2169223901","https://openalex.org/W2228089378","https://openalex.org/W2241571695","https://openalex.org/W2261717057","https://openalex.org/W2266714125","https://openalex.org/W2288746969","https://openalex.org/W2291620117","https://openalex.org/W2407137656","https://openalex.org/W2470861207","https://openalex.org/W2543598748","https://openalex.org/W2553055811","https://openalex.org/W2728241679","https://openalex.org/W2739409954","https://openalex.org/W2747404479","https://openalex.org/W2765884153","https://openalex.org/W2767084598","https://openalex.org/W2964154671"],"related_works":[],"abstract_inverted_index":{"Finding":[0],"the":[1,38,47,55,62,75,84,90,103,133,146,173],"dense":[2,23],"regions":[3,57],"of":[4,31,46,78,98,135,141,178],"a":[5,12,65,95,139],"graph":[6],"and":[7,19,37,52,87,123,149,160,166,176],"relations":[8],"among":[9],"them":[10],"is":[11,92],"fundamental":[13],"problem":[14],"in":[15],"network":[16],"analysis.":[17],"Core":[18],"truss":[20,109,124],"decompositions":[21,36],"reveal":[22],"subgraphs":[24],"with":[25],"hierarchical":[26],"relations.":[27],"The":[28],"incremental":[29],"nature":[30],"algorithms":[32,143,153,181],"for":[33,40,108],"computing":[34],"these":[35],"need":[39],"global":[41],"information":[42],"at":[43],"each":[44],"step":[45],"algorithm":[48],"hinders":[49],"scalable":[50],"parallelization":[51],"approximations":[53,162],"since":[54],"densest":[56],"are":[58,154],"not":[59],"revealed":[60],"until":[61],"end.":[63],"In":[64,126],"previous":[66],"work,":[67],"Lu":[68],"et":[69],"al.":[70],"proposed":[71],"to":[72,82,120,144,163],"iteratively":[73],"compute":[74],"h":[76,105],"-indices":[77],"neighbor":[79],"vertex":[80],"degrees":[81],"obtain":[83,145],"core":[85,122],"numbers":[86],"prove":[88,129],"that":[89],"convergence":[91,130],"obtained":[93],"after":[94],"finite":[96],"number":[97,134],"iterations.":[99,136],"This":[100],"work":[101],"generalizes":[102],"iterative":[104],"-index":[106],"computation":[107],"decomposition":[110,115],"as":[111,113],"well":[112],"nucleus":[114,150],"which":[116],"leverages":[117],"higher-order":[118],"structures":[119],"generalize":[121],"decompositions.":[125,151],"addition,":[127],"we":[128],"bounds":[131],"on":[132,182],"We":[137],"present":[138],"framework":[140],"local":[142,180],"core,":[147],"truss,":[148],"Our":[152,169],"local,":[155],"parallel,":[156],"offer":[157],"high":[158],"scalability,":[159,175],"enable":[161],"explore":[164],"time":[165],"quality":[167],"trade-offs.":[168],"shared-memory":[170],"implementation":[171],"verifies":[172],"efficiency,":[174],"effectiveness":[177],"our":[179],"real-world":[183],"networks.":[184]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2018-09-27T00:00:00"}