We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Finding secluded places of special interest in graphs.

Bevern, R.V. and Fluschnik, T. and Mertzios, G.B. and Molter, H. and Sorge, M. and Suchý, O. (2017) 'Finding secluded places of special interest in graphs.', in 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) : August 24-26, 2016, Aarhus, Denmark. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 5:1-5:16. Leibniz International Proceedings in Informatics (LIPIcs). (63).


Finding a vertex subset in a graph that satisfies a certain property is one of the most-studied topics in algorithmic graph theory. The focus herein is often on minimizing or maximizing the size of the solution, that is, the size of the desired vertex set. In several applications, however, we also want to limit the “exposure” of the solution to the rest of the graph. This is the case, for example, when the solution represents persons that ought to deal with sensitive information or a segregated community. In this work, we thus explore the (parameterized) complexity of finding such secluded vertex subsets for a wide variety of properties that they shall fulfill. More precisely, we study the constraint that the (open or closed) neighborhood of the solution shall be bounded by a parameter and the influence of this constraint on the complexity of minimizing separators, feedback vertex sets, F-free vertex deletion sets, dominating sets, and the maximization of independent sets.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution.
Download PDF
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Publisher statement:© René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Suchý; licensed under Creative Commons License CC-BY
Date accepted:24 July 2016
Date deposited:02 September 2016
Date of first online publication:31 January 2017
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar