Image from Syndetics
Combinatorial algorithms : theory and practice / Edward M. Reingold, Jurg Nievergelt and Narsingh Deo.
By: Reingold, Edward M
.
Contributor(s): Nievergelt, Jurg | Deo, Narsingh.
Material type: 
BookPublisher: Englewood Cliffs, N.J. : Prentice-Hall, 1977Description: xii, 433 p. : ill. ; 25 cm.ISBN: 013152447X.Subject(s): Combinatorial analysis -- Data processingDDC classification: 511.6
Contents:
What is combinatorial computing? -- Representation of combinatorial objects -- Counting and estimating -- Exhaustive search -- Generating elementary combinatorial objects -- Fast search -- Sorting -- Graph algorithms -- The equivalence of certain combinatorial problems.
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| General lending | MTU Bishopstown Library Store | 511.6 (Browse shelf(Opens below)) | 1 | Available | 00020918 | |
| General lending | MTU Bishopstown Library Store | 511.6 (Browse shelf(Opens below)) | 1 | Available | 00038748 |
Total holds: 0
Browsing MTU Bishopstown Library shelves, Shelving location: Store Close shelf browser (Hides shelf browser)
Includes bibliographical references and index.
What is combinatorial computing? -- Representation of combinatorial objects -- Counting and estimating -- Exhaustive search -- Generating elementary combinatorial objects -- Fast search -- Sorting -- Graph algorithms -- The equivalence of certain combinatorial problems.