Fixed-Parameter Tractable Distances to Sparse Graph Classes.

Jannis Bulian Anuj Dawar

Published in: Algorithmica (2017)

Keyphrases

fixed parameter tractable
bounded treewidth
parameterized complexity
computational problems
random walk
vertex set
directed acyclic graph
graph theoretic
directed graph
special case
database systems
global constraints
weighted graph
random graphs
graph structure
np complete
relational databases