2026-07-23T03:49:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6938 2024-03-06T10:38:47Z ddc:004 open_access

Finding Secluded Places of Special Interest in Graphs van Bevern, René Fluschnik, Till Mertzios, George B. Molter, Hendrik Sorge, Manuel Suchý, Ondrej Neighborhood Feedback Vertex Set Vertex Deletion Separator Dominating Set 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondrej Suchý 2017 Is Part Of LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2016.5 urn:nbn:de:0030-drops-69380 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.5 eng https://creativecommons.org/licenses/by/3.0/legalcode