On the Parameterized Complexity of Cutting a Few Vertices from a Graph.
Fedor V. FominPetr A. GolovachJanne H. KorhonenPublished in: MFCS (2013)
Keyphrases
- parameterized complexity
- weighted graph
- vertex set
- fixed parameter tractable
- undirected graph
- edge weights
- connected components
- random graphs
- graph theory
- random walk
- spanning tree
- directed acyclic graph
- graph theoretic
- graph structure
- directed graph
- structured data
- symmetry breaking
- bounded treewidth
- shortest path
- special case