Learn More

- Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
- IEICE Transactions
- 2014

Suppose that we are given two vertex covers C 0 and C t of a graph G, together with an integer threshold k ≥ max{|C 0 | , |C t |}. Then, the vertex cover reconfiguration problem is to determine whether there exists a sequence of vertex covers of G which transforms C 0 into C t such that each vertex cover in the sequence is of cardinality at most k and is… (More)

- ‹
- 1
- ›