当前位置: X-MOL 学术Acta Inform. › 论文详情
Using contracted solution graphs for solving reconfiguration problems
Acta Informatica ( IF 0.900 ) 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

 

全部期刊列表>>
欢迎访问IOP中国网站
自然职场线上招聘会
GIANT
产业、创新与基础设施
自然科研线上培训服务
材料学研究精选
胸腔和胸部成像专题
屿渡论文,编辑服务
何川
苏昭铭
陈刚
姜涛
李闯创
李刚
北大
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
上海纽约大学
张健
陈芬儿
厦门大学
史大永
吉林大学
卓春祥
张昊
杨中悦
试剂库存
down
wechat
bug