Reconfiguration of vertex covers in a graph

Takehiro Ito, Hiroyuki Nooka, Xiao Zhou

研究成果: Article査読

13 被引用数 (Scopus)

抄録

Suppose that we are given two vertex covers C0 and Ct of a graph G, together with an integer threshold k ≥ max{|C0|, |Ct|}. Then, the VERTEX COVER RECONFIGURATION problem is to determine whether there exists a sequence of vertex covers of G which transforms C0 into Ct such that each vertex cover in the sequence is of cardinality at most k and is obtained from the previous one by either adding or deleting exactly one vertex. This problem is PSPACE-complete even for planar graphs. In this paper, we first give a linear-time algorithm to solve the problem for even-hole-free graphs, which include several well-known graphs, such as trees, interval graphs and chordal graphs. We then give an upper bound on k for which any pair of vertex covers in a graph G has a desired sequence. Our upper bound is best possible in some sense.

本文言語English
ページ(範囲)598-606
ページ数9
ジャーナルIEICE Transactions on Information and Systems
E99D
3
DOI
出版ステータスPublished - 2016 3

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能

引用スタイル