Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable.
Mingyu XiaoHiroshi NagamochiPublished in: ICALP (2018)
Keyphrases
- fixed parameter tractable
- bounded treewidth
- bounded degree
- parameterized complexity
- np complete
- decision problems
- conjunctive queries
- vertex set
- np hard
- computational problems
- boolean functions
- graph theoretic
- relational learning
- global constraints
- constraint satisfaction problems
- database
- reasoning tasks
- integrity constraints