{"id":"https://openalex.org/W1576857282","doi":"https://doi.org/10.1145/2736277.2741640","title":"Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions","display_name":"Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions","publication_year":2015,"publication_date":"2015-05-18","ids":{"openalex":"https://openalex.org/W1576857282","doi":"https://doi.org/10.1145/2736277.2741640","mag":"1576857282"},"language":"en","primary_location":{"id":"doi:10.1145/2736277.2741640","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2736277.2741640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Conference on World Wide Web","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/servlets/purl/1252943","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020527664","display_name":"Ahmet Erdem Sar\u0131y\u00fcce","orcid":"https://orcid.org/0000-0002-4945-6821"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ahmet Erdem Sariyuce","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038687804","display_name":"C. Seshadhri","orcid":"https://orcid.org/0000-0003-2163-3555"},"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, Santa Cruz, CA, USA","University of California-Santa Cruz, Santa Cruz, CA, USA,"],"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"University of California-Santa Cruz, Santa Cruz, CA, USA,","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068770852","display_name":"Ali P\u0131nar","orcid":"https://orcid.org/0000-0002-2641-7344"},"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 Labs, Livermore, CA, USA"],"affiliations":[{"raw_affiliation_string":"Sandia National Labs, Livermore, CA, USA","institution_ids":["https://openalex.org/I192454743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026046737","display_name":"\u00dcmit V. \u00c7ataly\u00fcrek","orcid":"https://orcid.org/0000-0002-5625-3758"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umit V. Catalyurek","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020527664"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":12.7705,"has_fulltext":true,"cited_by_count":136,"citation_normalized_percentile":{"value":0.99031637,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"927","last_page":"937"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.986299991607666,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.986299991607666,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9753000140190125,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9751999974250793,"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.5762848854064941},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49400097131729126},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.47110942006111145},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4594275951385498},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4357340931892395},{"id":"https://openalex.org/keywords/nucleus","display_name":"Nucleus","score":0.43445801734924316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3994709551334381},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3420094847679138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3023361563682556},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1660710871219635},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.10347506403923035},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07830855250358582}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5762848854064941},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49400097131729126},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.47110942006111145},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4594275951385498},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4357340931892395},{"id":"https://openalex.org/C2780723820","wikidata":"https://www.wikidata.org/wiki/Q1934178","display_name":"Nucleus","level":2,"score":0.43445801734924316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3994709551334381},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3420094847679138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3023361563682556},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1660710871219635},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.10347506403923035},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07830855250358582},{"id":"https://openalex.org/C95444343","wikidata":"https://www.wikidata.org/wiki/Q7141","display_name":"Cell biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2736277.2741640","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2736277.2741640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Conference on World Wide Web","raw_type":"proceedings-article"},{"id":"pmh:oai:osti.gov:1252943","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1252943","pdf_url":"https://www.osti.gov/servlets/purl/1252943","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"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":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1252943","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1252943","pdf_url":"https://www.osti.gov/servlets/purl/1252943","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"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":null},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1576857282.pdf","grobid_xml":"https://content.openalex.org/works/W1576857282.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W168389790","https://openalex.org/W183656749","https://openalex.org/W950821216","https://openalex.org/W1489509891","https://openalex.org/W1499240152","https://openalex.org/W1535144194","https://openalex.org/W1604983895","https://openalex.org/W1849583273","https://openalex.org/W1888358353","https://openalex.org/W1968895412","https://openalex.org/W1971010887","https://openalex.org/W1972558815","https://openalex.org/W1974874717","https://openalex.org/W1978024959","https://openalex.org/W2005499394","https://openalex.org/W2013414394","https://openalex.org/W2013469283","https://openalex.org/W2017109153","https://openalex.org/W2019724001","https://openalex.org/W2023536175","https://openalex.org/W2032279394","https://openalex.org/W2032325851","https://openalex.org/W2043521128","https://openalex.org/W2055245094","https://openalex.org/W2060705109","https://openalex.org/W2061901927","https://openalex.org/W2070265204","https://openalex.org/W2071864549","https://openalex.org/W2072802070","https://openalex.org/W2081254453","https://openalex.org/W2091602684","https://openalex.org/W2094224753","https://openalex.org/W2100978151","https://openalex.org/W2102260665","https://openalex.org/W2110814195","https://openalex.org/W2112090702","https://openalex.org/W2114942458","https://openalex.org/W2116007667","https://openalex.org/W2118136127","https://openalex.org/W2119757574","https://openalex.org/W2121526866","https://openalex.org/W2148606255","https://openalex.org/W2151626491","https://openalex.org/W2160556205","https://openalex.org/W2167361513","https://openalex.org/W2169206507","https://openalex.org/W2217968126","https://openalex.org/W2317565191","https://openalex.org/W2953102514","https://openalex.org/W2990138404","https://openalex.org/W3104563092","https://openalex.org/W4250699352"],"related_works":["https://openalex.org/W1512756268","https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W1887488684","https://openalex.org/W2953496651","https://openalex.org/W2532922352","https://openalex.org/W1739013558","https://openalex.org/W167435155","https://openalex.org/W3208942821","https://openalex.org/W4300773579"],"abstract_inverted_index":{"Finding":[0],"dense":[1,55,70,151,199,203],"substructures":[2],"in":[3,14,60,117,182,223],"a":[4,7,22,81,96,103,110,126,183,194],"graph":[5,9,101],"is":[6,41,109,125],"fundamental":[8],"mining":[10],"operation,":[11],"with":[12,217],"applications":[13],"bioinformatics,":[15],"social":[16],"networks,":[17],"and":[18,63,78,166,177,201],"visualization":[19],"to":[20,43,49],"name":[21],"few.":[23],"Yet":[24],"most":[25],"standard":[26],"formulations":[27],"of":[28,95,105,123,164,185,190,198,205,219,221],"this":[29],"problem":[30],"(like":[31],"clique,":[32],"quasiclique,":[33],"k-densest":[34],"subgraph)":[35],"are":[36,115],"NP-hard.":[37],"Furthermore,":[38],"the":[39,45,61,92,100,131,154,157,161],"goal":[40],"rarely":[42],"find":[44,80],"\"true":[46],"optimum\",":[47],"but":[48],"identify":[50],"many":[51,118],"(if":[52],"not":[53],"all)":[54],"substructures,":[56,200],"understand":[57],"their":[58,180],"distribution":[59],"graph,":[62,97],"ideally":[64],"determine":[65],"relationships":[66],"among":[67],"them.":[68],"Current":[69],"subgraph":[71,111],"finding":[72],"algorithms":[73,173],"usually":[74],"optimize":[75],"some":[76],"objective,":[77],"only":[79],"few":[82],"such":[83],"subgraphs":[84,204],"without":[85],"providing":[86],"any":[87],"structural":[88],"relations.":[89],"We":[90,169],"define":[91],"nucleus":[93,108,158,175],"decomposition":[94,159],"which":[98,147],"represents":[99],"as":[102,135],"forest":[104,122],"nuclei.":[106,140],"Each":[107],"where":[112,130],"smaller":[113],"cliques":[114],"present":[116],"larger":[119],"cliques.":[120],"The":[121,188],"nuclei":[124,142,191],"hierarchy":[127],"by":[128],"containment,":[129],"edge":[132],"density":[133],"increases":[134],"we":[136],"proceed":[137],"towards":[138],"leaf":[139],"Sibling":[141],"can":[143,214],"have":[144],"limited":[145],"intersections,":[146],"enables":[148],"discovering":[149],"overlapping":[150],"subgraphs.":[152],"With":[153],"right":[155],"parameters,":[156],"generalizes":[160],"classic":[162],"notions":[163],"k-cores":[165],"k-truss":[167],"decompositions.":[168],"give":[170],"provably":[171],"efficient":[172],"for":[174],"decompositions,":[176],"empirically":[178],"evaluate":[179],"behavior":[181],"variety":[184],"real":[186],"graphs.":[187],"tree":[189],"consistently":[192],"gives":[193],"global,":[195],"hierarchical":[196],"snapshot":[197],"outputs":[202],"higher":[206],"quality":[207],"than":[208,225],"other":[209],"state-of-the-art":[210],"solutions.":[211],"Our":[212],"algorithm":[213],"process":[215],"graphs":[216],"tens":[218],"millions":[220],"edges":[222],"less":[224],"an":[226],"hour.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":22},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}