Exponentiality of the exchange algorithm for finding another room-partitioning

DOI10.1016/j.dam.2012.03.012zbMath1334.05164OpenAlexW2050295939MaRDI QIDQ496707

Jack Edmonds, Laura Sanità

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.012

zbMATH Keywords

exchange algorithmtwo-person gamesroom-partitioning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A PPA parity theorem about trees in a bipartite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How easy is local search?
• Some graphic uses of an even number of odd nodes
• On the complexity of the parity argument and other inefficient proofs of existence
• Euler Complexes
• Lemke Paths on Simple Polytopes
• A generalized complementary pivoting algorithm
• Equilibrium Points of Bimatrix Games
• Hard-to-Solve Bimatrix Games

This page was built for publication: Exponentiality of the exchange algorithm for finding another room-partitioning