On the parameterized complexity of cutting a few vertices from a graph
Fedor V. FominPetr A. GolovachJanne H. KorhonenPublished in: CoRR (2013)
Keyphrases
- parameterized complexity
- weighted graph
- undirected graph
- random graphs
- edge weights
- fixed parameter tractable
- vertex set
- graph theory
- random walk
- bounded treewidth
- global constraints
- directed acyclic graph
- directed graph
- constraint satisfaction
- graph theoretic
- logic programming
- small world
- spanning tree
- structured data
- complex networks