Tom�s Feder
- 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