Finding secluded places of special interest in graphs

René Van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondřej Suchý

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

2 Citations (Scopus)

Abstract

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, -free vertex deletion sets, dominating sets, and the maximization of independent sets.

Original languageEnglish
Title of host publication11th International Symposium on Parameterized and Exact Computation, IPEC 2016
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume63
ISBN (Electronic)9783959770231
DOIs
Publication statusPublished - 1 Feb 2017
Event11th International Symposium on Parameterized and Exact Computation, IPEC 2016 - Aarhus, Denmark
Duration: 24 Aug 201626 Aug 2016

Conference

Conference11th International Symposium on Parameterized and Exact Computation, IPEC 2016
CountryDenmark
CityAarhus
Period24.08.201626.08.2016

Keywords

  • Dominating set
  • Feedback vertex set
  • Neighborhood
  • Separator
  • Vertex deletion

Fingerprint

Dive into the research topics of 'Finding secluded places of special interest in graphs'. Together they form a unique fingerprint.

Cite this