Abstract
Given a graph G = (V,E), the minimum feedback vertex set V̄ is a subset of vertices of minimum size whose removal induces an acyclic subgraph G′ = (V/V̄, E′). The problem of finding V̄ 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̄ in a k-dimensional hypercube.
| Original language | English |
|---|---|
| Pages (from-to) | 1-5 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 76 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 20 Nov 2000 |
| Externally published | Yes |
Bibliographical note
Funding Information:*Corresponding author. Supported in part by MURST, Progetto “Certificazione automatica di programmi mediante interpretazione astratta”. E-mail addresses: [email protected] (R. Focardi), [email protected] (F.L. Luccio), [email protected] (D. Peleg).
Funding Information:
2 Supported in part by a grant from the Israel Ministry of Science and Art.
Funding
*Corresponding author. Supported in part by MURST, Progetto “Certificazione automatica di programmi mediante interpretazione astratta”. E-mail addresses: [email protected] (R. Focardi), [email protected] (F.L. Luccio), [email protected] (D. Peleg). 2 Supported in part by a grant from the Israel Ministry of Science and Art.
| Funders | Funder number |
|---|---|
| Israel Ministry of Science and Art | |
| MURST |