Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.
Tobias FriedrichDavis IssacNikhil KumarNadym MallekZiena ZeifPublished in: STOC (2023)
Keyphrases
- bounded treewidth
- max flow
- np complete
- monadic datalog
- decision problems
- conjunctive queries
- boolean functions
- energy minimization
- relational learning
- min cut
- convex programming
- graph cuts
- graph theoretic
- supervised learning
- multi label
- constraint satisfaction
- image reconstruction
- kernel methods
- computational complexity
- magnetic resonance imaging
- special case
- data model