[图书][B] Parameterized algorithms

M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx… - 2015 - Springer
The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

[HTML][HTML] Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

B Escoffier, L Gourvès, J Monnot - Journal of Discrete Algorithms, 2010 - Elsevier
We study a variation of the vertex cover problem where it is required that the graph induced
by the vertex cover is connected. We prove that this problem is polynomial in chordal …

Deterministic parameterized connected vertex cover

M Cygan - Algorithm Theory–SWAT 2012: 13th Scandinavian …, 2012 - Springer
Abstract In the Connected Vertex Cover problem we are given an undirected graph G
together with an integer k and we are to find a subset of vertices X of size at most k, such that …

On the complexity of solution extension of optimization problems

K Casel, H Fernau, MK Ghadikolaei, J Monnot… - Theoretical Computer …, 2022 - Elsevier
The question if a given partial solution to a problem can be extended reasonably occurs in
many algorithmic approaches for optimization problems. For instance, when enumerating …

edge dominating set: Efficient Enumeration-Based Exact Algorithms

H Fernau - International Workshop on Parameterized and Exact …, 2006 - Springer
We analyze edge dominating set from a parameterized perspective. More specifically, we
prove that this problem is in FPT for general (weighted) graphs. The corresponding …

[HTML][HTML] Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity

N Chiarelli, TR Hartinger, M Johnson, M Milanič… - Theoretical Computer …, 2018 - Elsevier
We perform a systematic study in the computational complexity of the connected variant of
three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle …

Enumerate and expand: Improved algorithms for connected vertex cover and tree cover

D Mölle, S Richter, P Rossmanith - Theory of Computing Systems, 2008 - Springer
We present a new method of solving graph problems related to Vertex Cover by
enumerating and expanding appropriate sets of nodes. As an application, we obtain …

Trust computing for social networking

Y Zuo, W Hu, T O'Keefe - 2009 Sixth International Conference …, 2009 - ieeexplore.ieee.org
Trust plays an important role in a Web-based social network. Given the open and dynamic
nature of such an online virtual community, trust evaluation relies on transitive relationships …

Connected vertex covers in dense graphs

J Cardinal, E Levy - Theoretical Computer Science, 2010 - Elsevier
We consider the variant of the minimum vertex cover problem in which we require that the
cover induces a connected subgraph. We give new approximation results for this problem in …

[HTML][HTML] Boundary classes for graph problems involving non-local properties

A Munaro - Theoretical Computer Science, 2017 - Elsevier
We continue the study of boundary classes for NP-hard problems and focus on seven NP-
hard graph problems involving non-local properties: Hamiltonian Cycle, Hamiltonian Cycle …