Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
From MaRDI portal
Publication:3656855
DOI10.1007/978-3-642-11269-0_9zbMath1273.68163MaRDI QIDQ3656855
Publication date: 14 January 2010
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_9
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An improved fixed-parameter algorithm for vertex cover
- An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications
- Improved Upper Bounds for Partial Vertex Cover
- Algorithms and Data Structures
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Going Weighted: Parameterized Algorithms for Cluster Editing