Finding Secluded Places of Special Interest in Graphs. van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. In Guo, J. & Hermelin, D., editors, IPEC 2016, volume 63, of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1–5:16. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017. doi abstract bibtex 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, F-free vertex deletion sets, dominating sets, and the maximization of independent sets.
@incollection{BFM+17,
author = {René van Bevern and Till Fluschnik and George
B. Mertzios and Hendrik Molter and Manuel Sorge and
Ondřej Suchý},
title = {Finding Secluded Places of Special Interest in
Graphs},
date = {2017-02-10},
booktitle = {IPEC 2016},
editor = {Jiong Guo and Danny Hermelin},
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, F-free
vertex deletion sets, dominating sets, and the
maximization of independent sets.},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics
(LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
doi = {10.4230/LIPIcs.IPEC.2016.5},
}
Downloads: 0
{"_id":"Z66JSKKStioL9T2zY","bibbaseid":"vanbevern-fluschnik-mertzios-molter-sorge-such-findingsecludedplacesofspecialinterestingraphs-2017","authorIDs":["2fwXJtKDCNhaSNr5s"],"author_short":["van Bevern, R.","Fluschnik, T.","Mertzios, G. B.","Molter, H.","Sorge, M.","Suchý, O."],"bibdata":{"bibtype":"incollection","type":"incollection","author":[{"firstnames":["René"],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]},{"firstnames":["Till"],"propositions":[],"lastnames":["Fluschnik"],"suffixes":[]},{"firstnames":["George","B."],"propositions":[],"lastnames":["Mertzios"],"suffixes":[]},{"firstnames":["Hendrik"],"propositions":[],"lastnames":["Molter"],"suffixes":[]},{"firstnames":["Manuel"],"propositions":[],"lastnames":["Sorge"],"suffixes":[]},{"firstnames":["Ondřej"],"propositions":[],"lastnames":["Suchý"],"suffixes":[]}],"title":"Finding Secluded Places of Special Interest in Graphs","date":"2017-02-10","booktitle":"IPEC 2016","editor":[{"firstnames":["Jiong"],"propositions":[],"lastnames":["Guo"],"suffixes":[]},{"firstnames":["Danny"],"propositions":[],"lastnames":["Hermelin"],"suffixes":[]}],"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, F-free vertex deletion sets, dominating sets, and the maximization of independent sets.","pages":"5:1–5:16","series":"Leibniz International Proceedings in Informatics (LIPIcs)","isbn":"978-3-95977-023-1","issn":"1868-8969","year":"2017","volume":"63","publisher":"Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik","doi":"10.4230/LIPIcs.IPEC.2016.5","bibtex":"@incollection{BFM+17,\n author =\t {René van Bevern and Till Fluschnik and George\n B. Mertzios and Hendrik Molter and Manuel Sorge and\n Ondřej Suchý},\n title =\t {Finding Secluded Places of Special Interest in\n Graphs},\n date =\t {2017-02-10},\n booktitle =\t {IPEC 2016},\n editor =\t {Jiong Guo and Danny Hermelin},\n abstract =\t {Finding a vertex subset in a graph that satisfies a\n certain property is one of the most-studied topics\n in algorithmic graph theory. The focus herein is\n often on minimizing or maximizing the size of the\n solution, that is, the size of the desired vertex\n set. In several applications, however, we also want\n to limit the \"exposure\" of the solution to the rest\n of the graph. This is the case, for example, when\n the solution represents persons that ought to deal\n with sensitive information or a segregated\n community. In this work, we thus explore the\n (parameterized) complexity of finding such secluded\n vertex subsets for a wide variety of properties that\n they shall fulfill. More precisely, we study the\n constraint that the (open or closed) neighborhood of\n the solution shall be bounded by a parameter and the\n influence of this constraint on the complexity of\n minimizing separators, feedback vertex sets, F-free\n vertex deletion sets, dominating sets, and the\n maximization of independent sets.},\n pages =\t {5:1--5:16},\n series =\t {Leibniz International Proceedings in Informatics\n (LIPIcs)},\n ISBN =\t {978-3-95977-023-1},\n ISSN =\t {1868-8969},\n year =\t {2017},\n volume =\t {63},\n publisher =\t {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n doi =\t\t {10.4230/LIPIcs.IPEC.2016.5},\n}\n\n","author_short":["van Bevern, R.","Fluschnik, T.","Mertzios, G. B.","Molter, H.","Sorge, M.","Suchý, O."],"editor_short":["Guo, J.","Hermelin, D."],"key":"BFM+17","id":"BFM+17","bibbaseid":"vanbevern-fluschnik-mertzios-molter-sorge-such-findingsecludedplacesofspecialinterestingraphs-2017","role":"author","urls":{},"metadata":{"authorlinks":{"van bevern, r":"https://rvb.su/"}},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://rvb.su/rvb.bib","creationDate":"2021-01-06T14:16:51.469Z","downloads":0,"keywords":[],"search_terms":["finding","secluded","places","special","interest","graphs","van bevern","fluschnik","mertzios","molter","sorge","suchý"],"title":"Finding Secluded Places of Special Interest in Graphs","year":2017,"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}