{"id":"https://openalex.org/W2550016344","doi":"https://doi.org/10.1137/1.9781611972771.65","title":"Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree","display_name":"Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree","publication_year":2007,"publication_date":"2007-04-26","ids":{"openalex":"https://openalex.org/W2550016344","doi":"https://doi.org/10.1137/1.9781611972771.65","mag":"2550016344"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611972771.65","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611972771.65","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 SIAM International Conference on Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110611660","display_name":"Barna Saha","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Barna Saha","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103721189","display_name":"Pabitra Mitra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pabitra Mitra","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110611660"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2608,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.61383648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"581","last_page":"586"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9908000230789185,"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.9908000230789185,"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.9887999892234802,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7300185561180115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6797563433647156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5926331877708435},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5088368058204651},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4632379412651062},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.45865508913993835},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4570155441761017},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43793854117393494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33675843477249146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2692769765853882},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23724165558815002},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13183030486106873}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7300185561180115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6797563433647156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5926331877708435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5088368058204651},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4632379412651062},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45865508913993835},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4570155441761017},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43793854117393494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33675843477249146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2692769765853882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23724165558815002},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13183030486106873}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611972771.65","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611972771.65","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 SIAM International Conference on Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4252842032","https://openalex.org/W2113270940","https://openalex.org/W2900627138","https://openalex.org/W3103742520","https://openalex.org/W4390579151"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"efficient":[3],"dynamic":[4],"algorithm":[5,17,33,42],"for":[6,51,85],"clustering":[7],"undirected":[8],"graphs,":[9],"whose":[10],"edge":[11],"property":[12],"is":[13,34,57,65,77],"changing":[14],"continuously.":[15],"The":[16,32,80],"maintains":[18],"clusters":[19,81],"of":[20,25,30,43,61],"high":[21],"quality":[22,86],"in":[23,72,89],"presence":[24],"insertion":[26],"and":[27,45,71],"deletion":[28],"(update)":[29],"edges.":[31],"motivated":[35],"by":[36],"the":[37,58,66,83],"minimum-cut":[38],"tree":[39],"based":[40],"partitioning":[41],"[3]":[44],"[4].":[46],"It":[47],"takes":[48],"O(k3)":[49],"time":[50,69,75],"each":[52],"update":[53,74],"processing,":[54],"where":[55],"k":[56],"maximum":[59],"size":[60],"any":[62],"cluster.":[63],"This":[64],"worst":[67],"case":[68],"complexity,":[70],"general":[73],"taken":[76],"much":[78],"less.":[79],"satisfy":[82],"bicriteria":[84],"guarantee":[87],"proposed":[88],"[3].":[90]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}