講座主題：Iterated Clique Reduction in Vertex Weighted Coloring for Large Sparse Graphs
專家姓名：蘇開樂(lè)
工作單位：澳大利亞格里菲斯大學(xué)
講座時(shí)間：2024年12月27日16:00-18:00
講座地點(diǎn)：科技館6205
主辦單位：煙臺(tái)大學(xué)計(jì)算機(jī)與控制工程學(xué)院
內(nèi)容摘要：
We propose a reduction algorithm based on maximal clique enumeration. More specifically our algorithm utilizes a certain proportion of maximal cliques and obtains lower bounds in order to perform reductions. It alternates between clique sampling and graph reductions and consists of three successive procedures: promising clique reductions, better bound reductions and post reductions. Experimental results show that our algorithm returns considerably smaller subgraphs for numerous large benchmark graphs, compared to the most recent method named RedLS. Also, we evaluate individual impacts and some practical properties of our algorithm. Furthermore, we have a theorem which indicates that the reduction effects of our algorithm are equivalent to that of a counterpart which enumerates all maximal cliques in the whole graph if the run time is sufficiently long.
主講人介紹：
蘇開樂(lè),，博士,，現(xiàn)任澳大利亞格里菲斯大學(xué)教授,，清華大學(xué)邏輯研究中心兼職教授,，南京信息工程大學(xué)人工智能學(xué)院名譽(yù)院長(zhǎng)。主要研究領(lǐng)域：人工智能邏輯與算法,。曾任中山大學(xué)（1999-2007）北京大學(xué)（2007-2014）教授博導(dǎo),。2005 年入選教育部“新世 紀(jì)人才支持計(jì)劃”，2007 年獲ping得了國(guó)家自然科學(xué)基金“杰出青年基 金”項(xiàng)目, 2013 年入選國(guó)家“百千萬(wàn)”人才工程國(guó)家級(jí)人選,，獲“國(guó)家有突出 貢獻(xiàn)中青年專家”稱號(hào),，享受國(guó)務(wù) 院特殊津貼。獲得 AiML 2002 (法國(guó)圖盧茲)最佳論文獎(jiǎng),，SAT Challenge 2012: Best Sequential Solver (Random Track)獎(jiǎng), 共發(fā)表了 30多篇中國(guó)計(jì)算學(xué)會(huì)(CCF)推薦 A 類論文,， 包括頂級(jí)會(huì)議 AAAI (15 篇),，IJCAI (10 篇),頂級(jí)期刊 Artificial Intelligence, Information and Computation,，IEEE Trans. on Computers, 和 IEEE Trans. on Software Engineering 等,。目前社會(huì)兼職：國(guó)家一級(jí)學(xué)報(bào)《軟件學(xué)報(bào)》《計(jì)算機(jī)研究與發(fā)展》編委，《IEEE Transactions on Cybernetics》副主編,，國(guó)家外國(guó)專家局重點(diǎn)引智項(xiàng)目（包括外專千人計(jì)劃）評(píng)審專家,。
