Parameterized Complexity of Secluded Connectivity Problems

The Secluded Path problem models a situation where sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure cost , which is the total cost of vertices in its closed neighborhood. The task is to select...

Celý popis

Podrobná bibliografie

Vydáno v:	Theory of computing systems Ročník 61; číslo 3; s. 795 - 819
Hlavní autoři:	Fomin, Fedor V., Golovach, Petr A., Karpov, Nikolay, Kulikov, Alexander S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2017 Springer Nature B.V
Témata:	Complexity Computer Science Decision trees Exposure Graphs Parameterization Shortest-path problems Terminals Theory of Computation Secluded Steiner tree Parameterized complexity Secluded path Kernelization
ISSN:	1432-4350, 1433-0490
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!