1. T. Feder, Stable Networks and Product Graphs, Doctoral Dissertation, Stanford University, 1991.
2. Using interior-point methods for fast parallel algorithms for bipartite matching and related problems;Goldberg;SIAM J. Comput.,1992
3. D. Gusfield, R.W. Irving, The Stable Marriage Problem: Structure and Algorithms, MIT Press Series in the Foundations of Computing, MIT Press, Cambridge, MA, 1989.
4. A polynomial-time algorithm for a class of linear complementarity problems;Kojima;Math. Program.,1989
5. The complexity of circuit value and network stability;Mayr;J. Comp. Systems Sci.,1992