BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-89-1275
       ENTRY:: January 05, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A new approach to stable matching problems
        TYPE:: Technical Report
      AUTHOR:: Subramanian, Ashok
        DATE:: August 1989
       PAGES:: 37
    ABSTRACT:: We show that Stable Matching problems are the same as
               problems about stable configurations of X-networks.
               Consequences include easy proofs of old theorems, a new
               simple algorithm for finding a stable matching, an
               understanding of the difference between Stable Marriage and
               Stable Roommates, NP-completeness of Three-party Stable
               Marriage, CC-completeness of several Stable Matching
               problems, and a fast parallel reduction from the Stable
               Marriage problem to the Assignment problem.
       NOTES:: [Adminitrivia V1/RAM/19950105]
         END:: STAN//CS-TR-89-1275