Pages that link to "Item:Q3252412"

The following pages link to Maximum-Minimum Sätze über Graphen (Q3252412):

Displaying 27 items.

• Weighted digraphs and tropical cones (Q273146) (← links)
• On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
• \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
• Brush your trees! (Q494441) (← links)
• Perfect zero-divisor graphs (Q507501) (← links)
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
• Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
• Characterization of the Walrasian equilibria of the assignment model (Q845010) (← links)
• On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
• Disjoint paths in a rectilinear grid (Q1051655) (← links)
• Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
• On the complexity of compressing two dimensional routing tables with order (Q1702127) (← links)
• A tropical isoperimetric inequality (Q1745120) (← links)
• The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
• The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory (Q2133400) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
• On separating sets of edges in contraction-critical graphs (Q2546876) (← links)
• A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• On odd circuits in chromatic graphs (Q5565636) (← links)
• Über reguläre Kettengruppen (Q5731398) (← links)
• Generating all vertices of a polyhedron is hard (Q5920505) (← links)
• Systems of representatives (Q5920823) (← links)
• Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)