Max Horn SAT and the minimum cut problem in directed hypergraphs
From MaRDI portal
Recommendations
- Directed hypergraphs and Horn minimization
- Maximum directed cuts in graphs with degree constraints
- Maximum directed cuts in acyclic digraphs
- Maximum directed cuts in digraphs with degree restriction
- Combinatorial approximation algorithms for the maximum directed cut problem
- Minimum cuts and sparsification in hypergraphs
- MaxCut in ${\bm H)$-Free Graphs
- Complexity of the max cut problem with the minimal domination constraint
- Hardness of cut problems in directed graphs
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 2077139 (Why is no real title available?)
- scientific article; zbMATH DE number 956857 (Why is no real title available?)
- Directed hypergraphs and applications
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- Dynamic maintenance of directed hypergraphs
- Flows on hypergraphs
- Gainfree Leontief substitution flow problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic-based decision support. Mixed integer model formulation
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- On the complexity of the maximum satisfiability problem for Horn formulas
- Satisfiability of co-nested formulas
Cited in
(6)
This page was built for publication: Max Horn SAT and the minimum cut problem in directed hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380929)
