Network flow and 2-satisfiability

1994/03/01 by T. Feder, Tom�s Feder · 1 citation
Computer Science · Economics, Econometrics and Finance · Mathematics · #Advanced Graph Theory Research #Algorithm #Closure (psychology) #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Flow (mathematics) #Flow network #Game Theory and Voting Systems #Integer (computer science) #Matching (statistics) #Mathematical optimization #Mathematics #Maximum flow problem #Satisfiability #Theory of computation #Transitive closure

paper · doi:10.1007/bf01240738

crossref issued 1994/03/01 · crossref published 1994/03/01 · crossref published-print 1994/03/01 · openalex publication_date 1994/03/01 · crossref created 2005/02/25 · crossref deposited 2019/04/30 · openalex created_date 2025/10/10 · crossref indexed 2026/05/07 · openalex updated_date 2026/07/29

Citations

• On the Complexity of Timetable and Multicommodity Flow Problems
• A data structure for dynamic trees
• An efficient algorithm for the “optimal” stable marriage
• College Admissions and the Stability of Marriage
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Three Fast Algorithms for Four Problems in Stable Marriage
• Depth-First Search and Linear Graph Algorithms
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

Cited by

• 2-satisfiability [wikipedia]