Feedback vertex set in hypercubes
Given a graph G = (V, E), the minimum feedback vertex set (V) over bar is a subset of vertices of minimum size whose removal induces an acyclic subgraph G' = (V \ (V) over bar, E'). The problem of finding (V) over bar is NP-hard for general networks but interesting polynomial solutions have been found for particular graph classes. In this paper we find close upper and lower bounds to the size of (V) over bar in a k-dimensional hypercube. (C) 2000 Elsevier Science B.V. All rights reserved.
feedback vertex set hypercube cycle codes combinatorial problems