Finding secluded places of special interest in graphs

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Finding secluded places of special interest in graphs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Finding secluded places of special interest in graphs

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GP14-13017P" target="_blank" >GP14-13017P: Parametrizované algoritmy pro základní síťové problémy spojené se souvislostí</a><br>

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-3-95977-023-1

ISSN

—

e-ISSN

1868-8969

Počet stran výsledku

16

Strana od-do

"5:1"-"5:16"

Název nakladatele

Schloss Dagstuhl - Leibniz Center for Informatics

Místo vydání

Wadern

Místo konání akce

Aarhus

Datum konání akce

24. 8. 2016

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—