Stable marriage and its relation to other combinatorial problems : an introduction to the mathematical analysis of algorithms

By: Knuth, Donald ErvinMaterial type: Computer fileComputer fileSeries: CRM Proceedings and Lecture Notes ; v. 10Publication details: Providence, R.I. : American Mathematical Society, c1997Description: 1 online resource (xiii, 74 p. : ill.)ISBN: 9781470439248 (online)Subject(s): Combinatorial analysis | Marriage theoremOnline resources: Click here to access online
Contents:
Lecture 1. Introduction, definitions, and examples ; Lecture 2. Existence of a stable matching: the fundamental algorithm ; Lecture 3. Principle of deferred decisions: coupon collecting ; Lecture 4. Theoretical developments: application to the shortest path ; Lecture 5. Searching a table by hashing ; mean behavior of the fundamental algorithm ; Lecture 6. Implementing the fundamental algorithm ; Lecture 7. Research problems
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number URL Status Date due Barcode Item holds
electronic book electronic book
Link to resource Accessible Online EBK20953
Total holds: 0

Includes bibliographical references (p. 67-68) and index.

Lecture 1. Introduction, definitions, and examples ; Lecture 2. Existence of a stable matching: the fundamental algorithm ; Lecture 3. Principle of deferred decisions: coupon collecting ; Lecture 4. Theoretical developments: application to the shortest path ; Lecture 5. Searching a table by hashing ; mean behavior of the fundamental algorithm ; Lecture 6. Implementing the fundamental algorithm ; Lecture 7. Research problems

There are no comments on this title.

to post a comment.