Parameterized Complexity of Secluded Connectivity Problems

DOI10.4230/LIPIcs.FSTTCS.2015.408zbMath1366.68091OpenAlexW2602167371MaRDI QIDQ5275383

Nikolay Karpov, Petr A. Golovach, Fedor V. Fomin, Alexander S. Kulikov

Publication date: 13 July 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2015.html#FominGKK15

zbMATH Keywords

parameterized complexitysecluded pathsecluded Steiner tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (1)

Parameterized complexity of secluded connectivity problems

This page was built for publication: Parameterized Complexity of Secluded Connectivity Problems