Login / Signup

Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs.

Rajesh Hemant ChitnisFedor V. FominPetr A. Golovach
Published in: FSTTCS (2013)
Keyphrases
  • directed graph
  • parameterized complexity
  • random walk
  • directed acyclic graph
  • undirected graph
  • graph structure
  • fixed parameter tractable
  • global constraints
  • symmetry breaking
  • disjoint paths