The Curse of Connectivity: t-Total Vertex (Edge) Cover
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 34-43
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Vertex and edge covers with clustering properties: Complexity and algorithmsJournal of Discrete Algorithms, 2009
- Counting Subgraphs via Homomorphisms2009
- Incompressibility through Colors and IDs2009
- Kernel Bounds for Disjoint Cycles and Disjoint Paths2009
- On Problems without Polynomial Kernels (Extended Abstract)2008
- Parameterized Complexity of Vertex Cover VariantsTheory of Computing Systems, 2007
- Improved Parameterized Upper Bounds for Vertex Cover2006
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Color-codingJournal of the ACM, 1995
- Constant Time Generation of Rooted TreesSIAM Journal on Computing, 1980