Summary: Mating Search Without Path
Enumeration
Matthew Bishop
April 21, 1999
Submitted in partial fuløllment
of the requirements for
the degree of Doctor of Philosophy
Department of Mathematical Sciences,
Carnegie Mellon University,
Pittsburgh, PA 15213


Contents
Abstract vii
Acknowledgements ix
Chapter 1. Introduction 1
1.1. Background 1
1.2. Objectives 2
1.3. Brief Description 3
1.4. General Principles 4

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

Collections: Mathematics