Parameterized complexity of the induced subgraph problem in directed graphs.

Venkatesh Raman Somnath Sikdar

Published in: Inf. Process. Lett. (2007)

Keyphrases

directed graph
parameterized complexity
random walk
fixed parameter tractable
global constraints
np hard
directed acyclic graph
symmetry breaking
graph mining
graph structure
undirected graph
graph databases
search algorithm
graph structures
constraint programming
np complete
special case