当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Faster Graph bipartization
Journal of Computer and System Sciences ( IF 1.129 ) Pub Date : 2019-12-05 , DOI: 10.1016/j.jcss.2019.11.001
Sudeshna Kolay; Pranabendu Misra; M.S. Ramanujan; Saket Saurabh

In the Graph bipartization (or Odd Cycle Transversal) problem, the objective is to decide whether a given graph G can be made bipartite by the deletion of k vertices for some given k. The parameterized complexity of Odd Cycle Transversal was resolved in the breakthrough paper of Reed, Smith and Vetta [Operations Research Letters, 2004], who developed an algorithm running in time O(3kkmn). The question of improving the dependence on the input size to linear, which was another long standing open problem in the area, was resolved by Iwata et al. [SICOMP 2016] and Ramanujan and Saurabh [TALG 2017], who presented O(4k(m+n)) and 4kkO(1)(m+n) algorithms respectively. In this paper, we obtain a faster algorithm that runs in time 3kkO(1)(m+n) and hence preserves the linear dependence on the input size while nearly matching the dependence on k incurred by the algorithm of Reed, Smith and Vetta.
更新日期:2020-01-04

 

全部期刊列表>>
宅家赢大奖
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
深圳大学二维材料实验室张晗
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug