Presentation 2011-12-16
Reconfiguration of Vertex Covers in Trees and Cacti
Hiroyuki NOOKA, Takehiro ITO, Xiao ZHOU,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We study the problem of reconfiguring a vertex cover of a graph G into another vertex cover via vertex covers of G, each of which results from the previous one by deleting or adding a single vertex, without ever going through a vertex cover of size more than k, for a given integer threshold k. This decision problem is known to be PSPACE-complete for planar graphs. In this paper, we first give a sufficient condition on the threshold k for which there always exists a reconfiguration between any two vertex covers for cacti. We then give a linear-time algorithm for trees to compute the minimum threshold k for which there exists a reconfiguration between two given vertex covers.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) algorithm / cactus / reachability on solution space / tree / vertex cover
Paper # COMP2011-39
Date of Issue

Conference Information
Committee COMP
Conference Date 2011/12/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Reconfiguration of Vertex Covers in Trees and Cacti
Sub Title (in English)
Keyword(1) algorithm
Keyword(2) cactus
Keyword(3) reachability on solution space
Keyword(4) tree
Keyword(5) vertex cover
1st Author's Name Hiroyuki NOOKA
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Takehiro ITO
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Xiao ZHOU
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2011-12-16
Paper # COMP2011-39
Volume (vol) vol.111
Number (no) 360
Page pp.pp.-
#Pages 8
Date of Issue