Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 474-483
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Improved Tree Decomposition Based Algorithms for Domination-like Problems2002
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Parameterized Complexity of Finding Subgraphs with Hereditary PropertiesLecture Notes in Computer Science, 2000
- Parameterized complexity: A framework for systematically confronting computational intractability1999
- An improved fixed-parameter algorithm for vertex coverInformation Processing Letters, 1998
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- On the approximability of some maximum spanning tree problemsTheoretical Computer Science, 1997
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Parameterized Computational Feasibility1995
- A short note on the approximability of the maximum leaves spanning tree problemInformation Processing Letters, 1994