Exponentiality of the exchange algorithm for finding another room-partitioning

DOI10.1016/J.DAM.2012.03.012MaRDI QIDQ496707zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On finding another room-partitioning of the vertices
• Sperner oiks
• On the complexity of exchange-stable roommates
• Oriented Euler complexes and signed perfect matchings
• Hard-to-Solve Bimatrix Games

Cites work

• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 4199652 (Why is no real title available?)
• A generalized complementary pivoting algorithm
• Equilibrium Points of Bimatrix Games
• Euler complexes
• Finding Gale strings
• Hard-to-Solve Bimatrix Games
• How easy is local search?
• Lemke Paths on Simple Polytopes
• On the complexity of the parity argument and other inefficient proofs of existence
• Some graphic uses of an even number of odd nodes

Cited in

(2)

• On finding another room-partitioning of the vertices
• A PPA parity theorem about trees in a bipartite graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496707)