{"id":"https://openalex.org/W2975055887","doi":"https://doi.org/10.1145/3344210","title":"Density-Friendly Graph Decomposition","display_name":"Density-Friendly Graph Decomposition","publication_year":2019,"publication_date":"2019-09-24","ids":{"openalex":"https://openalex.org/W2975055887","doi":"https://doi.org/10.1145/3344210","mag":"2975055887"},"language":"en","primary_location":{"id":"doi:10.1145/3344210","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3344210","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"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":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1904.03467","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Nikolaj Tatti","orcid":"https://orcid.org/0000-0002-2087-5360"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]},{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Nikolaj Tatti","raw_affiliation_strings":["Helsinki Institute for Information Technology, University of Helsinki, and Aalto University"],"raw_orcid":"https://orcid.org/0000-0002-2087-5360","affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology, University of Helsinki, and Aalto University","institution_ids":["https://openalex.org/I32943570","https://openalex.org/I9927081","https://openalex.org/I133731052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"],"apc_list":null,"apc_paid":null,"fwci":0.8165,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.77605685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"5","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6998999714851379,"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.6998999714851379,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.09440000355243683,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05460000038146973,"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/centrality","display_name":"Centrality","score":0.5544999837875366},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.550000011920929},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4932999908924103},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.48429998755455017},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4650000035762787},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.45210000872612},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4496999979019165},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.4408999979496002},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.3767000138759613},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.35850000381469727}],"concepts":[{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.5544999837875366},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.550000011920929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5331000089645386},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4932999908924103},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.48429998755455017},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4650000035762787},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.45210000872612},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4496999979019165},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.4408999979496002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3953000009059906},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.3767000138759613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36390000581741333},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.35850000381469727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3538999855518341},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3474000096321106},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.3458000123500824},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3393000066280365},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3359000086784363},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3352000117301941},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3255999982357025},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.3206000030040741},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.31529998779296875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3075999915599823},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.3012999892234802},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.29170000553131104},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.26969999074935913},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.2694999873638153},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.26840001344680786},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2632000148296356},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.26109999418258667},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3344210","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3344210","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"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":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1904.03467","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.03467","pdf_url":"https://arxiv.org/pdf/1904.03467","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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:1904.03467","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.03467","pdf_url":"https://arxiv.org/pdf/1904.03467","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2975055887.pdf","grobid_xml":"https://content.openalex.org/works/W2975055887.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1660722709","https://openalex.org/W1924929788","https://openalex.org/W1967956032","https://openalex.org/W1983383464","https://openalex.org/W2016511206","https://openalex.org/W2017109153","https://openalex.org/W2057058417","https://openalex.org/W2094224753","https://openalex.org/W2100978151","https://openalex.org/W2116007667","https://openalex.org/W2133131640","https://openalex.org/W2133238553","https://openalex.org/W2148606255","https://openalex.org/W2156020699","https://openalex.org/W2159929956","https://openalex.org/W2162808198","https://openalex.org/W2168911445","https://openalex.org/W2169088933","https://openalex.org/W2266714125","https://openalex.org/W2605272442","https://openalex.org/W2806295024","https://openalex.org/W3153434246","https://openalex.org/W4241669766"],"related_works":[],"abstract_inverted_index":{"Decomposing":[0],"a":[1,4,12,24,33,83,124,138,170,175,216,221,240],"graph":[2,34,50,108,176,274],"into":[3],"hierarchical":[5],"structure":[6,256],"via":[7],"k":[8,20,71,78,94,105,151,235,252,267],"-core":[9,21,72,95,236],"analysis":[10,73],"is":[11,23,43,96,197,207,238],"standard":[13],"operation":[14],"in":[15,48,154,161,186,210,250],"any":[16],"modern":[17],"graph-mining":[18],"toolkit.":[19],"decomposition":[22,141,173,195,237],"simple":[25],"and":[26,54,56,107,131,261],"efficient":[27],"method":[28],"that":[29,70,134,168,219,233],"allows":[30,58],"to":[31,45,59,126,146,224],"analyze":[32],"beyond":[35],"its":[36],"mere":[37],"degree":[38],"distribution.":[39],"More":[40],"specifically,":[41],"it":[42,57,121],"used":[44],"identify":[46],"areas":[47],"the":[49,61,65,68,91,99,111,143,147,157,193,225,234,265],"of":[51,64,113,142,163,192],"increasing":[52,164],"centrality":[53],"connectedness,":[55],"reveal":[60],"structural":[62],"organization":[63],"graph.":[66],"Despite":[67],"fact":[69],"relies":[74],"on":[75],"vertex":[76],"degrees,":[77],"-cores":[79,106,253,268],"do":[80],"not":[81,97,270],"satisfy":[82],"certain,":[84],"rather":[85],"natural,":[86],"density":[87,109],"property.":[88],"Simply":[89],"put,":[90],"most":[92],"central":[93],"necessarily":[98],"densest":[100],"subgraph.":[101],"This":[102],"inconsistency":[103],"between":[104],"provides":[110,220],"basis":[112],"our":[114,135,247],"study.":[115],"We":[116,166],"start":[117],"by":[118,150,246,264],"defining":[119],"what":[120],"means":[122],"for":[123,174],"subgraph":[125],"be":[127,184],"locally":[128,171,227,258],"dense":[129,172,228,259],",":[130,180],"we":[132,214,231],"show":[133,167,232],"definition":[136],"entails":[137],"nested":[139],"chain":[140],"graph,":[144],"similar":[145],"one":[148],"given":[149],"-cores,":[152],"but":[153,206],"this":[155],"case":[156],"components":[158],"are":[159,269],"arranged":[160],"order":[162],"density.":[165,275],"such":[169],"G":[177],"=(":[178],"V":[179,200],"E":[181,204],")":[182],"can":[183],"computed":[185],"polynomial":[187],"time.":[188],"The":[189],"running":[190],"time":[191],"exact":[194],"algorithm":[196,218],"O":[198],"(|":[199],"|":[201,203],"2":[202],"|)":[205],"significantly":[208],"faster":[209],"practice.":[211],"In":[212],"addition,":[213],"develop":[215],"linear-time":[217],"factor-2":[222,241],"approximation":[223],"optimal":[226],"decomposition.":[229],"Furthermore,":[230],"also":[239],"approximation,":[242],"however,":[243],"as":[244,262],"demonstrated":[245],"experimental":[248],"evaluation,":[249],"practice":[251],"have":[254],"different":[255],"than":[257],"subgraphs,":[260],"predicted":[263],"theory,":[266],"always":[271],"well-aligned":[272],"with":[273]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2019-10-03T00:00:00"}