{"id":"https://openalex.org/W4385585323","doi":"https://doi.org/10.1145/3587135.3594558","title":"Parallel Incremental Clustering Algorithms for Massive Dynamic Graphs","display_name":"Parallel Incremental Clustering Algorithms for Massive Dynamic Graphs","publication_year":2023,"publication_date":"2023-05-09","ids":{"openalex":"https://openalex.org/W4385585323","doi":"https://doi.org/10.1145/3587135.3594558"},"language":"en","primary_location":{"id":"doi:10.1145/3587135.3594558","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3587135.3594558","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3587135.3594558","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3587135.3594558","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087562583","display_name":"Johannes Langguth","orcid":"https://orcid.org/0000-0003-4200-511X"},"institutions":[{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Johannes Langguth","raw_affiliation_strings":["Simula Research Laboratory, Oslo, Norway"],"raw_orcid":"https://orcid.org/0000-0003-4200-511X","affiliations":[{"raw_affiliation_string":"Simula Research Laboratory, Oslo, Norway","institution_ids":["https://openalex.org/I2799829267"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087562583"],"corresponding_institution_ids":["https://openalex.org/I2799829267"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09472656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"264","last_page":"264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.998199999332428,"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/T11106","display_name":"Data Management and Algorithms","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/cluster-analysis","display_name":"Cluster analysis","score":0.8043607473373413},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7103236317634583},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6411426663398743},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5432272553443909},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5259594917297363},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45409008860588074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44098618626594543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4317063093185425},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4219004511833191},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.41379520297050476},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.4058327376842499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19026196002960205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16851592063903809},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15427044034004211}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8043607473373413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7103236317634583},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6411426663398743},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5432272553443909},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5259594917297363},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45409008860588074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44098618626594543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4317063093185425},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4219004511833191},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.41379520297050476},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.4058327376842499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19026196002960205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16851592063903809},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15427044034004211},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3587135.3594558","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3587135.3594558","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3587135.3594558","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3587135.3594558","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3587135.3594558","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3587135.3594558","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM International Conference on Computing Frontiers","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385585323.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2491448268","https://openalex.org/W2559422900","https://openalex.org/W2892323093","https://openalex.org/W3144143113","https://openalex.org/W2394193399","https://openalex.org/W2181939267","https://openalex.org/W2390610678","https://openalex.org/W3071522575","https://openalex.org/W2363054820","https://openalex.org/W2160785859"],"abstract_inverted_index":{"We":[0,112],"consider":[1],"the":[2,9,23,80,83,94,114,152],"problem":[3,27],"of":[4,19,22,82,86,151],"incremental":[5,120],"graph":[6,10],"clustering":[7,70,121,139,153],"where":[8,43],"to":[11,66,106],"be":[12],"clustered":[13],"is":[14,62,104,135],"given":[15],"as":[16,39],"a":[17,148],"sequence":[18],"disjoint":[20],"subsets":[21],"edge":[24],"set.":[25],"The":[26,128],"appears":[28],"when":[29,52],"dealing":[30],"with":[31,124,142],"graphs":[32,141],"that":[33,107,132],"are":[34,55,91],"created":[35],"over":[36],"time,":[37,96],"such":[38,97],"online":[40],"social":[41],"networks":[42,51],"new":[44,53],"users":[45],"appear":[46],"continuously,":[47],"or":[48],"protein":[49],"interaction":[50],"proteins":[54],"discovered.":[56],"For":[57],"very":[58],"large":[59,149],"graphs,":[60],"it":[61],"computationally":[63],"too":[64],"expensive":[65],"repeatedly":[67],"apply":[68],"standard":[69],"algorithms.":[71,111],"Instead,":[72],"algorithms":[73,98],"whose":[74,102],"time":[75],"complexity":[76],"only":[77],"depends":[78],"on":[79],"size":[81],"incoming":[84],"subset":[85],"edges":[87],"in":[88],"every":[89],"step":[90],"needed.":[92],"At":[93],"same":[95],"should":[99],"find":[100],"clusters,":[101],"quality":[103],"close":[105],"produced":[108],"by":[109],"offline":[110],"discuss":[113],"computational":[115],"model":[116],"and":[117],"present":[118],"an":[119],"algorithm,":[122],"along":[123],"its":[125],"parallel":[126],"implementation.":[127],"scalability":[129],"results":[130],"suggest":[131],"our":[133],"method":[134],"well":[136],"suited":[137],"for":[138],"massive":[140],"acceptable":[143],"running":[144],"times":[145],"while":[146],"retaining":[147],"fraction":[150],"quality.":[154]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}