The stable marriage problem : structure and algorithms /
The intent of this book is to give a comprehensive exposition of the algorithmic and structural results concerning the stable marriage problem and its variants. It is written at the level of advanced undergraduate and beginning graduate students and offers a coherent introduction for all those who w...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro |
| Lenguaje: | Inglés |
| Publicado: |
Cambridge, Mass. :
MIT Press,
c1989.
|
| Colección: | Foundations of computing
|
| Materias: | |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 01581cam a2200385 a 4500 | ||
|---|---|---|---|
| 001 | 990000612350204151 | ||
| 005 | 20180327175114.0 | ||
| 008 | 890315s1989 maua b 001 0 eng | ||
| 010 | |a 89032042 | ||
| 015 | |a GB90-11365 | ||
| 016 | 7 | |a B90-11365 |2 uk | |
| 019 | |a 21078384 | ||
| 020 | |a 0262071185 | ||
| 020 | |a 9780262071185 | ||
| 020 | |a 9780262515528 (pbk) | ||
| 020 | |a 0262515520 (pbk) | ||
| 035 | |a (OCoLC)000061235 | ||
| 035 | |a (udesa)000061235USA01 | ||
| 035 | |a (OCoLC)19555666 |z (OCoLC)21078384 | ||
| 035 | |a (OCoLC)990000612350204151 | ||
| 040 | |a DLC |b eng |c DLC |d FPU |d UKM |d MUQ |d BTCTA |d YDXCP |d BAKER |d ZWZ |d HEBIS |d OCLCQ |d BDX |d GBVCP |d U@S | ||
| 049 | |a U@SA | ||
| 050 | 0 | 0 | |a QA164 |b .G87 1989 |
| 082 | 0 | 0 | |a 511/.6 |2 20 |
| 100 | 1 | |a Gusfield, Dan. | |
| 245 | 1 | 4 | |a The stable marriage problem : |b structure and algorithms / |c Dan Gusfield and Robert W. Irving. |
| 260 | |a Cambridge, Mass. : |b MIT Press, |c c1989. | ||
| 300 | |a xvii, 240 p. : |b ill. ; |c 24 cm. | ||
| 490 | 1 | |a Foundations of computing | |
| 504 | |a Includes bibliographical references (p. [227]-234). | ||
| 520 | |a The intent of this book is to give a comprehensive exposition of the algorithmic and structural results concerning the stable marriage problem and its variants. It is written at the level of advanced undergraduate and beginning graduate students and offers a coherent introduction for all those who wish to enter this field of research. | ||
| 650 | 0 | |a Marriage theorem. | |
| 650 | 7 | |a Teorema del matrimonio. |2 UDESA | |
| 700 | 1 | |a Irving, Robert W. | |
| 830 | 0 | |a Foundations of computing | |