{"id":"https://openalex.org/W4414359945","doi":"https://doi.org/10.24963/ijcai.2025/352","title":"Dynamic Seed-GrowthCM: A Dynamic Benefit-Oriented Algorithm for Core Maximization on Large Graphs","display_name":"Dynamic Seed-GrowthCM: A Dynamic Benefit-Oriented Algorithm for Core Maximization on Large Graphs","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414359945","doi":"https://doi.org/10.24963/ijcai.2025/352"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/352","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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/A5101113171","display_name":"Dongyuan Ma","orcid":"https://orcid.org/0009-0003-3790-6244"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dongyuan Ma","raw_affiliation_strings":["Tianjin University"],"affiliations":[{"raw_affiliation_string":"Tianjin University","institution_ids":["https://openalex.org/I162868743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009013876","display_name":"Dongxiao He","orcid":"https://orcid.org/0000-0002-1915-4179"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dongxiao He","raw_affiliation_strings":["Tianjin University"],"affiliations":[{"raw_affiliation_string":"Tianjin University","institution_ids":["https://openalex.org/I162868743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031729932","display_name":"Xin Huang","orcid":"https://orcid.org/0000-0002-5625-0338"},"institutions":[{"id":"https://openalex.org/I141568987","display_name":"Hong Kong Baptist University","ror":"https://ror.org/0145fw131","country_code":"HK","type":"education","lineage":["https://openalex.org/I141568987"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xin Huang","raw_affiliation_strings":["Hong Kong Baptist University"],"affiliations":[{"raw_affiliation_string":"Hong Kong Baptist University","institution_ids":["https://openalex.org/I141568987"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101113171"],"corresponding_institution_ids":["https://openalex.org/I162868743"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13971882,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3162","last_page":"3170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9959999918937683,"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.9959999918937683,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.988099992275238,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6891999840736389},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6032999753952026},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.5547000169754028},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.5307999849319458},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5149999856948853},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5048999786376953},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4797999858856201},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4147999882698059},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.40119999647140503}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6891999840736389},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6032999753952026},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.5547000169754028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5437999963760376},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5307999849319458},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5159000158309937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5149999856948853},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5048999786376953},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4797999858856201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4551999866962433},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4147999882698059},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3869999945163727},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37709999084472656},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2842999994754791},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2522999942302704},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/352","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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":[],"abstract_inverted_index":{"The":[0],"k-core":[1,20],"has":[2,31],"garnered":[3],"significant":[4],"attention":[5],"in":[6,119,215],"recent":[7],"research":[8],"as":[9,23,161],"an":[10,49,182],"effective":[11],"measure":[12],"of":[13,34,71,130,195,217],"node":[14,30,120],"importance":[15],"within":[16],"a":[17,32,46,53,93,106,124,173,188,225],"graph.":[18],"A":[19],"is":[21,58,76,176],"defined":[22],"the":[24,41,56,69,85,112,116,128,137,146,153,157,162,179,196,200],"maximal":[25],"induced":[26],"subgraph":[27],"where":[28],"each":[29,166],"degree":[33],"at":[35],"least":[36],"k.":[37],"This":[38,74,150],"paper":[39],"addresses":[40],"core":[42],"maximization":[43],"problem:":[44],"given":[45],"graph":[47],"G,":[48],"integer":[50],"k,":[51],"and":[52,82,98],"budget":[54],"b,":[55],"objective":[57],"to":[59,67,79,91,136,199],"insert":[60],"b":[61],"new":[62,125,174],"distinct":[63],"edges":[64,131],"into":[65,178],"G":[66],"maximize":[68],"size":[70],"its":[72],"k-core.":[73],"problem":[75],"theoretically":[77],"proven":[78],"be":[80],"NP-hard":[81],"APX-hard.":[83],"However,":[84],"existing":[86,183],"heuristic":[87],"methods":[88,214],"often":[89],"struggle":[90],"achieve":[92],"good":[94],"balance":[95],"between":[96],"efficiency":[97],"answer":[99],"quality.":[100],"In":[101,165],"this":[102],"paper,":[103],"we":[104,144],"propose":[105],"novel":[107],"dynamic":[108,117],"approach":[109],"that,":[110],"for":[111],"first":[113],"time,":[114],"uncovers":[115],"changes":[118],"degrees.":[121],"We":[122],"introduce":[123],"concept":[126],"using":[127],"contribution":[129],"across":[132],"different":[133],"\u03bb-shell":[134,154,197],"components":[135,194],"final":[138],"solution.":[139,201],"Based":[140],"on":[141,169,204,220],"these":[142],"findings,":[143],"present":[145],"Dynamic":[147],"Seed-GrowthCM":[148],"method.":[149],"method":[151],"selects":[152],"component":[155,198],"with":[156],"largest":[158],"estimated":[159],"benefit":[160],"initial":[163],"seed.":[164],"iteration,":[167],"depending":[168],"complete/partial":[170],"growth,":[171,186],"either":[172],"seed":[175,184,190],"incorporated":[177],"solution,":[180],"or":[181],"undergoes":[185],"becoming":[187],"larger":[189],"by":[191],"adding":[192],"connected":[193],"Experimental":[202],"results":[203],"ten":[205],"datasets":[206],"demonstrate":[207],"that":[208],"our":[209],"algorithm":[210],"significantly":[211],"outperforms":[212],"state-of-the-art":[213],"terms":[216],"solution":[218],"quality":[219],"large":[221],"graphs,":[222],"while":[223],"achieving":[224],"high":[226],"computational":[227],"efficiency.":[228]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}