{"id":"https://openalex.org/W2605272442","doi":"https://doi.org/10.1145/3038912.3052619","title":"Large Scale Density-friendly Graph Decomposition via Convex Programming","display_name":"Large Scale Density-friendly Graph Decomposition via Convex Programming","publication_year":2017,"publication_date":"2017-04-03","ids":{"openalex":"https://openalex.org/W2605272442","doi":"https://doi.org/10.1145/3038912.3052619","mag":"2605272442"},"language":"en","primary_location":{"id":"doi:10.1145/3038912.3052619","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3038912.3052619","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on World Wide Web","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3038912.3052619","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002266394","display_name":"Maximilien Danisch","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Maximilien Danisch","raw_affiliation_strings":["T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France"],"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018708584","display_name":"T-H. Hubert Chan","orcid":"https://orcid.org/0000-0002-8340-235X"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"T.-H. Hubert Chan","raw_affiliation_strings":["The University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057257639","display_name":"Mauro Sozio","orcid":"https://orcid.org/0000-0002-2031-3974"},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I205703379","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mauro Sozio","raw_affiliation_strings":["T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France"],"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9com ParisTech, Universit\u00e9 Paris-Saclay, Paris, France","institution_ids":["https://openalex.org/I12356871","https://openalex.org/I277688954"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002266394"],"corresponding_institution_ids":["https://openalex.org/I12356871","https://openalex.org/I277688954"],"apc_list":null,"apc_paid":null,"fwci":4.9848,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.96090662,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9986000061035156,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9986000061035156,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9848999977111816,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.635444700717926},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6335198879241943},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5748458504676819},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5332619547843933},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43792304396629333},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4195636510848999},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41683095693588257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40723487734794617},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12569010257720947},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12138053774833679}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.635444700717926},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6335198879241943},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5748458504676819},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5332619547843933},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43792304396629333},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4195636510848999},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41683095693588257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40723487734794617},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12569010257720947},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12138053774833679},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3038912.3052619","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3038912.3052619","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on World Wide Web","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01699048v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01699048","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WWW, 2017, Perth, Australia","raw_type":"Conference papers"},{"id":"pmh:oai:hub.hku.hk:10722/245440","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/245440","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference_Paper"}],"best_oa_location":{"id":"doi:10.1145/3038912.3052619","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3038912.3052619","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on World Wide Web","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W905619","https://openalex.org/W183656749","https://openalex.org/W1525888637","https://openalex.org/W1535144194","https://openalex.org/W1572663059","https://openalex.org/W1576857282","https://openalex.org/W1586552957","https://openalex.org/W1604983895","https://openalex.org/W1823437338","https://openalex.org/W1924929788","https://openalex.org/W1964419312","https://openalex.org/W1972558815","https://openalex.org/W1977458171","https://openalex.org/W1988888548","https://openalex.org/W2005499394","https://openalex.org/W2010772252","https://openalex.org/W2012998203","https://openalex.org/W2013414394","https://openalex.org/W2023536175","https://openalex.org/W2051109346","https://openalex.org/W2101196063","https://openalex.org/W2106818977","https://openalex.org/W2115659887","https://openalex.org/W2118136127","https://openalex.org/W2119757574","https://openalex.org/W2121493622","https://openalex.org/W2121526866","https://openalex.org/W2133131640","https://openalex.org/W2133238553","https://openalex.org/W2136850043","https://openalex.org/W2153250079","https://openalex.org/W2159929956","https://openalex.org/W2166136432","https://openalex.org/W2168911445","https://openalex.org/W2217968126","https://openalex.org/W2258998514","https://openalex.org/W2259724869","https://openalex.org/W2553356062","https://openalex.org/W2583892328","https://openalex.org/W2755088640","https://openalex.org/W2951803119","https://openalex.org/W2953102514","https://openalex.org/W6729893200"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W2965083567","https://openalex.org/W4235240664","https://openalex.org/W1838576100","https://openalex.org/W2095886385","https://openalex.org/W2889616422","https://openalex.org/W2089704382","https://openalex.org/W1996198939","https://openalex.org/W2596554829","https://openalex.org/W2372780902"],"abstract_inverted_index":{"Algorithms":[0],"for":[1,72,104,107,157,247],"finding":[2],"dense":[3],"regions":[4],"in":[5,15,54,66,128,197,235],"an":[6,117,154,161,221],"input":[7],"graph":[8,16,30,67],"have":[9],"proved":[10],"to":[11,40,86,123,133,166,171,189],"be":[12,194],"effective":[13],"tools":[14],"mining":[17],"and":[18,23,192,215],"data":[19],"analysis.":[20,240],"Recently,":[21],"Tatti":[22],"Gionis":[24],"[WWW":[25],"2015]":[26],"presented":[27],"a":[28,60,63,80,110,140,209,254],"novel":[29],"decomposition":[31,61,76,92,146],"(known":[32],"as":[33],"the":[34,41,46,74,90,95,151,182,200,248],"locally-dense":[35,126,145],"decomposition)":[36],"that":[37,49,163,229],"is":[38,77,121,179,187,243],"similar":[39,188],"well-known":[42],"k-core":[43],"decomposition,":[44,156],"with":[45,204],"additional":[47],"property":[48],"its":[50],"components":[51],"are":[52],"arranged":[53],"order":[55],"of":[56,135,143,150,153,173,175,199,212,252],"their":[57,70,216,238],"densities.":[58],"Such":[59],"provides":[62],"valuable":[64],"tool":[65],"mining.":[68],"Unfortunately,":[69],"algorithm":[71,82,119,162,178,185,242],"computing":[73,108,253],"exact":[75,125,155],"based":[78,180],"on":[79,181,225],"maximum-flow":[81],"which":[83,120,147,158,186],"cannot":[84],"scale":[85,165],"massive":[87,205],"graphs,":[88],"while":[89],"approximate":[91,144],"defined":[93],"by":[94],"same":[96],"authors":[97],"misses":[98],"several":[99],"interesting":[100],"properties.":[101],"This":[102],"calls":[103],"scalable":[105],"algorithms":[106,214,231],"such":[109],"decomposition.":[111],"In":[112],"our":[113,213,230],"work,":[114],"we":[115,138,159],"devise":[116,160],"efficient":[118,246],"able":[122],"compute":[124],"decompositions":[127],"real-world":[129,167],"graphs":[130,168],"containing":[131,169],"up":[132,170],"billions":[134,174],"edges.":[136,176],"Moreover,":[137],"provide":[139,208],"new":[141],"definition":[142],"retains":[148],"most":[149,198],"properties":[152],"can":[164,193],"tens":[172],"Our":[177,241],"classic":[183],"Frank-Wolfe":[184],"gradient":[190],"descent":[191],"efficiently":[195],"implemented":[196],"modern":[201],"architectures":[202,227],"dealing":[203],"graphs.":[206],"We":[207,219],"rigorous":[210],"study":[211],"convergence":[217],"rates.":[218],"conduct":[220],"extensive":[222],"experimental":[223],"evaluation":[224],"multi-core":[226],"showing":[228],"converge":[232],"much":[233],"faster":[234],"practice":[236],"than":[237],"worst-case":[239],"even":[244],"more":[245,249],"specialized":[250],"problem":[251],"densest":[255],"subgraph.":[256]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}