Recommendations
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 4027472 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- A bounded approximation for the minimum cost 2-sat problem
- A data structure for dynamic trees
- A decomposition theorem for partially ordered sets
- A linear-time approximation algorithm for the weighted vertex cover problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- College Admissions and the Stability of Marriage
- Depth-First Search and Linear Graph Algorithms
- Equivalent approximation algorithms for node cover
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- Finding Minimum-Cost Circulations by Successive Approximation
- Improved Time Bounds for the Maximum Flow Problem
- On likely solutions of a stable marriage problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- Parametric stable marriage and minimum cuts
- Performance analysis of voting strategies for a fly-by-wire system of a fighter aircraft
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Counting Stable Marriages
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
- Three Fast Algorithms for Four Problems in Stable Marriage
- Vertex packings: Structural properties and algorithms
Cited in
(29)- scientific article; zbMATH DE number 4041594 (Why is no real title available?)
- The stable roommates problem with short lists
- Understanding popular matchings via stable matchings
- scientific article; zbMATH DE number 7561396 (Why is no real title available?)
- The stable marriage problem with master preference lists
- A compact representation for minimizers of \(k\)-submodular functions
- Popularity, Mixed Matchings, and Self-Duality
- scientific article; zbMATH DE number 1472098 (Why is no real title available?)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- Adapting stable matchings to forced and forbidden pairs
- An artificial neural network satisfiability tester
- The Stable Roommates Problem with Short Lists
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
- Quasi-popular matchings, optimality, and extended formulations
- The binary network flow problem is logspace complete for P
- Maximum matchings and popularity
- The minimum spanning tree problem with conflict constraints and its variations
- scientific article; zbMATH DE number 1004242 (Why is no real title available?)
- The complete set of minimal simple graphs that support unsatisfiable 2-CNFs
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case
- Argumentation frameworks as constraint satisfaction problems
- Efficient algorithms for generalized stable marriage and roommates problems
- Compact linear programs for 2SAT
- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
- scientific article; zbMATH DE number 3984929 (Why is no real title available?)
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for publication: Network flow and 2-satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317481)
