Standard

Finding secluded places of special interest in graphs. / Van Bevern, René; Fluschnik, Till; Mertzios, George B. и др.

11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Том 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 5.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаяРецензирование

Harvard

Van Bevern, R, Fluschnik, T, Mertzios, GB, Molter, H, Sorge, M & Suchý, O 2017, Finding secluded places of special interest in graphs. в 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Том. 63, 5, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, Aarhus, Дания, 24.08.2016. https://doi.org/10.4230/LIPIcs.IPEC.2016.5

APA

Van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. (2017). Finding secluded places of special interest in graphs. в 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 (Том 63). [5] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2016.5

Vancouver

Van Bevern R, Fluschnik T, Mertzios GB, Molter H, Sorge M, Suchý O. Finding secluded places of special interest in graphs. в 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Том 63. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 5 doi: 10.4230/LIPIcs.IPEC.2016.5

Author

Van Bevern, René ; Fluschnik, Till ; Mertzios, George B. и др. / Finding secluded places of special interest in graphs. 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Том 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017.

BibTeX

@inproceedings{2cdad9b38837431d90ddd494a5520db9,
title = "Finding secluded places of special interest in graphs",
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.",
keywords = "Dominating set, Feedback vertex set, Neighborhood, Separator, Vertex deletion",
author = "{Van Bevern}, Ren{\'e} and Till Fluschnik and Mertzios, {George B.} and Hendrik Molter and Manuel Sorge and Ond{\v r}ej Such{\'y}",
note = "Publisher Copyright: {\textcopyright} 2016 Ren{\'e} van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Such{\'y}.; 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 ; Conference date: 24-08-2016 Through 26-08-2016",
year = "2017",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.IPEC.2016.5",
language = "English",
volume = "63",
booktitle = "11th International Symposium on Parameterized and Exact Computation, IPEC 2016",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
address = "Germany",

}

RIS

TY - GEN

T1 - Finding secluded places of special interest in graphs

AU - Van Bevern, René

AU - Fluschnik, Till

AU - Mertzios, George B.

AU - Molter, Hendrik

AU - Sorge, Manuel

AU - Suchý, Ondřej

N1 - Publisher Copyright: © 2016 René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Suchý.

PY - 2017/2/1

Y1 - 2017/2/1

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

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

KW - Dominating set

KW - Feedback vertex set

KW - Neighborhood

KW - Separator

KW - Vertex deletion

UR - http://www.scopus.com/inward/record.url?scp=85014676215&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.IPEC.2016.5

DO - 10.4230/LIPIcs.IPEC.2016.5

M3 - Conference contribution

AN - SCOPUS:85014676215

VL - 63

BT - 11th International Symposium on Parameterized and Exact Computation, IPEC 2016

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 11th International Symposium on Parameterized and Exact Computation, IPEC 2016

Y2 - 24 August 2016 through 26 August 2016

ER -

ID: 9088089