Login / Signup
Parameterized complexity of vertex deletion into perfect graph classes.
Pinar Heggernes
Pim van 't Hof
Bart M. P. Jansen
Stefan Kratsch
Yngve Villanger
Published in:
Theor. Comput. Sci. (2013)
Keyphrases
</>
parameterized complexity
directed graph
undirected graph
vertex set
fixed parameter tractable
graph structure
connected components
graph theory
random walk
directed acyclic graph
graph theoretic
data model
knowledge representation
structured data
edge weights
bounded treewidth