Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable.
Naomi NishimuraVijay SubramanyaPublished in: COCOA (2) (2017)
Keyphrases
- fixed parameter tractable
- bounded treewidth
- parameterized complexity
- structured data
- graph structure
- directed graph
- weighted graph
- vertex set
- np hard
- graph theory
- computational problems
- np complete
- connected components
- directed acyclic graph
- spanning tree
- undirected graph
- random graphs
- random walk
- databases
- lower bound