A new fixed point approach for stable networks stable marriages

No abstract is available for this paper.

• Publication year

  1989

• Venue

  Symposium on the Theory of Computing

• Publication date

  1989-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/73007.73056
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Dynamic location problem for graphs

  1989cited by this paper
• Retract rigid cartesian products of graphs

  1988cited by this paper
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments

  1988cited by this paper
• Retracts of graphs

  1988cited by this paper
• Three Fast Algorithms for Four Problems in Stable Marriage

  1987cited by this paper
• Absolute Retracts and Varieties of Reflexive Graphs

  1987cited by this paper
• Dynamic Search in Graphs

  1987cited by this paper
• A fixed cube theorem for median graphs

  1987cited by this paper
• An efficient algorithm for the “optimal” stable marriage

  1987cited by this paper
• Every finite distributive lattice is a set of stable matchings for a small stable marriage instance

  1987cited by this paper
• The Complexity of Counting Stable Marriages

  1986cited by this paper
• On the complexity of stable matchings with and without ties

  1986cited by this paper
• On isometric embeddings of graphs

  1985cited by this paper
• An Efficient Algorithm for the "Stable Roommates" Problem

  1985cited by this paper
• Are search and decision programs computationally equivalent?

  1985cited by this paper
• Retracts of hypercubes

  1984cited by this paper
• Notes on Introductory Combinatorics

  1983cited by this paper
• N-cubes and Median Graphs

  1980cited by this paper
• Review of "Mariages stables et leur relations avec d'autre problèmes combinatoires: introduction à l'analyze mathématique des algorithmes" by Donald E. Knuth. Les Presses de l'Université de Montréal.

  1978cited by this paper
• Introductory Combinatorics

  1977cited by this paper

• The Distortion of Stable Matching

  2026cites this paper
• The popular matching problem in the roommates instance remains NP-hard in bounded degree graphs

  2025cites this paper
• Chaos-Enhanced Fractional-Order Iterative Methods for the Stable and Efficient Solution of Nonlinear Engineering Problems

  2025influential citation
• Two-sided profile-based optimality in the stable marriage problem

  2019cites this paper
• Stable Marriage and Roommates Problems with Restricted Edges: Complexity and Approximability

  2014cites this paper
• Algorithmics of Matching Under Preferences

  2013cites this paper
• Stable schedule matchings

  2012cites this paper
• Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings

  2011cites this paper
• Stable schedule matchings by a fixed point method

  2010cites this paper
• Consistent concepts of self-organization and self-assembly

  2008cites this paper
• Optimal Stable Marriage

  2008cites this paper
• The Stable Roommates Problem with Choice Functions

  2008cites this paper
• Table-turning to Stable Marriage satisfaction and equity

  2007cites this paper
• Stable matchings and linear programming

  1996cites this paper
• Stable Matchings and Linear Inequalities

  1994cites this paper
• Network flow and 2-satisfiability

  1994cites this paper
• A bounded approximation for the minimum cost 2-sat problem

  1992cites this paper
• On likely solutions of a stable matching problem

  1992cites this paper
• A New Fixed Point Approach for Stable Networks and Stable Marriages

  1992cites this paper
• On selecting a satisfying truth assignment

  1991cites this paper
• The complexity of circuit value and network stability

  1989influential citation
• Lower bounds for the stable marriage problem and its variants

  1989cites this paper
• A New Approach to Stable Matching Problems

  1989cites this paper