SCOPUS 정보 검색 플랫폼

Volumn 34, Issue 3, 1987, Pages 532-543

An efficient algorithm for the “optimal” stable marriage

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

STABLE MARRIAGE PROBLEM; STABLE MATCHING;

COMPUTER PROGRAMMING;

EID: 0023382768 PISSN: 00045411 EISSN: 1557735X Source Type: Journal
DOI: 10.1145/28869.28871 Document Type: Article

Times cited : (232)

References (14)

1
- 0003415652
- Addison-Wesley, Reading, Mass.]
- AHO, A. V., HOPCROFT, J. E., and ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.]
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 0003165311
- College admissions and the stability of marriage
- GALE, D., AND SHAPELY, L. S. College admissions and the stability of marriage. Am. Math. Monthly 69 (1962), 9-15.]
- (1962) Am. Math. Monthly , vol.69 , pp. 9-15
- Gale, D.¹ Shapely, L.S.²

3
- 0023288575
- Three fast algorithms for four problems in stable marriage
- GUSFIELD, D. Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16 (1987), 111-128.]
- (1987) SIAM J. Comput. , vol.16 , pp. 111-128
- Gusfield, D.¹

4
- 0039468436
- An efficient algorithm for the “stable room-mates” problem
- IRVING, R.W. An efficient algorithm for the “stable room-mates” problem. J. Algorithms 6 (1985), 577-595.]
- (1985) J. Algorithms , vol.6 , pp. 577-595
- Irving, R.W.¹

5
- 0022766622
- The complexity of counting stable marriages
- IRVING, R. W., AND LEATHER, P. The complexity of counting stable marriages. SIAM J. Comput. 15 (1986), 655-667.]
- (1986) SIAM J. Comput. , vol.15 , pp. 655-667
- Irving, R.W.¹ Leather, P.²

6
- 0004202801
- Les Presses de l'Universit6 de Montr6al, Montr6al, Quebec, Canada.]
- KNUTH, D. E. Mariages Stables. Les Presses de l'Universit6 de Montr6al, Montr6al, Quebec, Canada 1976.]
- (1976) Mariages Stables
- Knuth, D.E.¹

7
- 0015097972
- The stable marriage problem
- MCVITIE, D., AND WILSON, L. B. The stable marriage problem. Commun. ACM 14 (1971), 486-492.]
- (1971) Commun. ACM , vol.14 , pp. 486-492
- Mcvitie, D.¹ Wilson, L.B.²

8
- 0016972463
- Maximum closure of a graph and applications to combinatorial problems
- PICARD, J. Maximum closure of a graph and applications to combinatorial problems. Manage. Sci. 22 (1976), 1268-1272.]
- (1976) Manage. Sci. , vol.22 , pp. 1268-1272
- Picard, J.¹

9
- 0020208962
- Selected applications of minimum cuts in networks
- PICARD, J., AND QUEYRANNE, M. Selected applications of minimum cuts in networks, INFOR– Can. J. Oper. Res. Inf. Process. 20 (1982), 394-422.]
- (1982) INFOR– Can. J. Oper. Res. Inf. Process. , vol.20 , pp. 394-422
- Picard, J.¹ Queyranne, M.²

10
- 0003521202
- Birkhauser Vedag, Boston, Mass.]
- POLYA, G., TARJAN, R. E., AND WOODS, D.R. Notes on Introductory Combinatorics. Birkhauser Vedag, Boston, Mass., 1983.]
- (1983) Notes on Introductory Combinatorics
- Polya, G.¹ Tarjan, R.E.² Woods, D.R.³

11
- 0014869124
- A selection problem of shared fixed costs and network flows
- RHYS, J. A selection problem of shared fixed costs and network flows. Manage. Sci. 17 (1970), 200-207.]
- (1970) Manage. Sci. , vol.17 , pp. 200-207
- Rhys, J.¹

12
- 0020766586
- Comput
- SLEATOR, D., and TARJAN, R.E. A data structure for dynamic trees, J. Comput. Syst. Sci. 26 (1983), 362-391.]
- (1983) Syst. Sci. , vol.26 , pp. 362-391
- Sleator, D.¹ Tarjan, R.E.² trees, J.³

13
- 84944834051
- SIAM, Philadelphia, Pa.]
- TARJAN, R.E. Data Structures and Algorithms. SIAM, Philadelphia, Pa., 1983.]
- (1983) Data Structures and Algorithms
- Tarjan, R.E.¹

14
- 84945710755
- WIRTH, N. Algorithms + Data Structures = Programs, Prentice-Hall, Englewood Cliffs, N.J., 1976.]
- (1976)
- Wirth, N.¹ Englewood Cliffs, N.J.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.