Sign in
The parameterized complexity of editing graphs for bounded degeneracy.
Luke Mathieson
Published in:
Theor. Comput. Sci. (2010)
Keyphrases
</>
parameterized complexity
bounded treewidth
fixed parameter tractable
np complete
np hard
computational problems
global constraints
conjunctive queries
decision problems
optimal solution
directed graph
special case
graph theory
graph structure
spanning tree
vertex set