Finding secluded places of special interest in graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00313785" target="_blank" >RIV/68407700:21240/17:00313785 - isvavai.cz</a>

Result on the web

<a href="http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=6938" target="_blank" >http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=6938</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.5" target="_blank" >10.4230/LIPIcs.IPEC.2016.5</a>

Result language

angličtina

Original language name

Finding secluded places of special interest in graphs

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GP14-13017P" target="_blank" >GP14-13017P: Parameterized Algorithms for Fundamental Network Problems Related to Connectivity</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

11th International Symposium on Parameterized and Exact Computation (IPEC 2016)

ISBN

978-3-95977-023-1

ISSN

—

e-ISSN

1868-8969

Number of pages

16

Pages from-to

"5:1"-"5:16"

Publisher name

Schloss Dagstuhl - Leibniz Center for Informatics

Place of publication

Wadern

Event location

Aarhus

Event date

Aug 24, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—