Sciweavers

51 search results - page 1 / 11
» Improved upper bounds for vertex cover
Sort
View
STACS
1999
Springer
13 years 9 months ago
Upper Bounds for Vertex Cover Further Improved
tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of G...
Rolf Niedermeier, Peter Rossmanith
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 6 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
DM
2008
104views more  DM 2008»
13 years 5 months ago
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
Florent R. Madelaine, Iain A. Stewart