当前位置: X-MOL 学术Acta Inform. › 论文详情
Using contracted solution graphs for solving reconfiguration problems
Acta Informatica ( IF 1.042 ) Pub Date : 2019-05-31 , DOI: 10.1007/s00236-019-00336-8
Paul Bonsma, Daniël Paulusma

Abstract We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge contractions that decrease the graph size without losing any critical information needed to solve the reconfiguration problem under consideration. Our general framework captures the approach behind known reconfiguration results of Bonsma (Discrete Appl Math 231:95–112, 2017) and Hatanaka et al. (IEICE Trans Fundam Electron Commun Comput Sci 98(6):1168–1178, 2015). As a third example, we apply the method to the following well-studied problem: given two k-colorings \(\alpha \) and \(\beta \) of a graph G, can \(\alpha \) be modified into \(\beta \) by recoloring one vertex of G at a time, while maintaining a k-coloring throughout? This problem is known to be PSPACE-hard even for bipartite planar graphs and \(k=4\) . By applying our method in combination with a thorough exploitation of the graph structure we obtain a polynomial-time algorithm for \((k-2)\) -connected chordal graphs.
更新日期:2020-01-04

 

全部期刊列表>>
2020新春特辑
限时免费阅读临床医学内容
ACS材料视界
科学报告最新纳米科学与技术研究
清华大学化学系段昊泓
自然科研论文编辑服务
中国科学院大学楚甲祥
上海纽约大学William Glover
中国科学院化学研究所
课题组网站
X-MOL
北京大学分子工程苏南研究院
华东师范大学分子机器及功能材料
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug