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

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 61; no. 3; pp. 795 - 819
Main Authors:	Fomin, Fedor V., Golovach, Petr A., Karpov, Nikolay, Kulikov, Alexander S.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2017 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!