scientific article; zbMATH DE number 7278110

DOI10.4230/LIPICS.FSTTCS.2017.38zbMath1491.91037MaRDI QIDQ5136330

Moshe Y. Vardi, Orna Kupferman, Gal Vardi

Publication date: 25 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmstwo-player gamesflow networks

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Flows in graphs (05C21)

Related Items (2)

Unnamed Item ⋮ Spanning-Tree Games.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous approximated determinization of weighted automata
• On saturation games
• A strongly polynomial minimum cost circulation algorithm
• Number of quantifiers is better than number of tape cells
• A BGP-based mechanism for lowest-cost routing
• Maximal Flow Through a Network
• The Price of Stability for Network Design with Fair Cost Allocation
• A new approach to the maximum-flow problem
• Alternation
• Totally Balanced Games and Games of Flow
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the combinational complexity of certain symmetric Boolean functions
• Algorithmic Game Theory
• The Map-Coloring Game
• Possible Winners in Partially Completed Tournaments
• The complexity of theorem-proving procedures

This page was built for publication: