Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › Рецензирование
Finding secluded places of special interest in graphs. / Van Bevern, René; Fluschnik, Till; Mertzios, George B. и др.
Leibniz International Proceedings in Informatics, LIPIcs. Том 63 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 5 (Leibniz International Proceedings in Informatics, LIPIcs; Том 63).Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › Рецензирование
}
TY - CHAP
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
UR - https://www.mendeley.com/catalogue/45fcc9d0-6601-3607-a332-9aba34533180/
U2 - 10.4230/LIPIcs.IPEC.2016.5
DO - 10.4230/LIPIcs.IPEC.2016.5
M3 - Chapter
AN - SCOPUS:85014676215
SN - 9783959770231
VL - 63
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - Leibniz International Proceedings in Informatics, LIPIcs
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