cover image

Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf.

; Wilf, Herbert S., 1931-2012
2d ed.. New York : Academic Press, 1978.
ISBN 0125192606, 9780125192606

Location Call Number Status Consortium Loan
George Washington
WRLC Shared Collections Facility
QA 164 .N54 1978 (show me on map) Off-site
Request
American
LIB stacks
QA164 .N54 1978 Available Request
Gallaudet
UNIV Electronic Book
Electronic Book
George Mason
Fenwick stacks
QA164 .N54 1978 Available Request
Other Authors Wilf, Herbert S., 1931-2012.
Subjects Algorithmes.
Algorithmus.
Algoritmos E Estruturas De Dados.
Analise Combinatoria.
Analyse combinatoire -- Logiciels.
Combinatieleer.
Combinatorial analysis -- Computer programs.
Computer algorithms.
FORTRAN.
Kombinatorik.
Programmierung.
Software.
Series Computer science and applied mathematics.
Description xv, 302 pages : illustrations ; 24 cm.
Copyright Date 1978.
Notes First edition published in 1975 under title: Combinatorial algorithms.
Includes bibliographical references (pages 296-298) and index.
Contents pt. I. Combinatorial families. Next subset of an n-set (NEXSUB/LEXSUB) -- Random subset of an n-set (RANSUB) -- Next k-subset of an n-set (NEXKSB/NXKSRD) -- Random k-subset of an n-set (RANKSB) -- Next composition of n into k parts (NEXCOM) -- Random composition of n into k parts (RANCOM) -- Next permutation of n letters (NEXPER) -- Random permutation of n letters (RANPER) -- Next partition of integer n (NEXPAR) -- Random partition of an integer n (RANPAR) -- Next partition of an n-set (NEXEQU) -- Random partition of an n-set (RANEQU) -- Sequencing, ranking, and selection algorithms in general combinatorial families (SELECT) -- Young tableaux (NEXYTB/RANYTB) -- part II. Combinatorial structures. Sorting (HPSORT/EXHEAP) -- The cycle structure of a permutation (CYCLES) -- Renumbering rows and columns of an array (RENUMB) -- Spanning forest of a graph (SPANFO) -- Newton forms of a polynomial (POLY) -- Chromatic polynomial of a graph (CHROMP) -- Composition of power series (POWSER) -- Network flows (NETFLO) -- The permanent function (PERMAN) -- Invert a triangular array (INVERT) -- Triangular numbering in partially ordered sets (TRIANG) -- The MoĢˆbius function (MOBIUS) -- The backtrack method (BACKTR) -- Labeled trees (LBLTRE) -- Random unlabeled rooted trees (RANRUT) -- Tree of minimal length (MINSPT).
Network Numbers (OCoLC)4005010
(OCoLC)ocm04005010
WorldCat Search OCLC WorldCat
WorldCat Identities Nijenhuis, Albert.
Publication timeline, list of works, related names and subjects and other information

Services

Export citation to: RefWorks