Parameterized complexity of the anchored k-core problem for directed graphs.

Rajesh Chitnis Fedor V. Fomin Petr A. Golovach

Published in: Inf. Comput. (2016)

Keyphrases

directed graph
parameterized complexity
random walk
global constraints
fixed parameter tractable
directed acyclic graph
undirected graph
strongly connected
symmetry breaking
database systems
special case
np hard
state space
computational problems
disjoint paths