Fixed-parameter Tractable Distances to Sparse Graph Classes.

Jannis Bulian Anuj Dawar

Published in: IPEC (2015)

Keyphrases

fixed parameter tractable
parameterized complexity
bounded treewidth
weighted graph
directed graph
graph theory
structured data
np hard
np complete
graph structure
global constraints
computational problems
search algorithm
directed acyclic graph