| Title: | Mathematics at DEC |
| Moderator: | RUSURE::EDP |
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
A book I would highly like to recommend is Albert Nijenhuis and Herbert S. Wilf, Combinatorial Algorithms, second edition, Academic Press, New York: 1978. It contains a large number of algorithms written in machine-independent fortran. These algorithms are all combinatorial in nature, unlike most of the algorithms you find around these days. There is hardly any floating point in them at all. If you're a pure mathematician (as opposed to an applied mathematician), you're sure to love this book. Sample algorithms: Produce a random subset of a set of n elements Produce all partitions of a number n Produce all permutations on n elements Span a tree Produce Sterling numbers Calculate Moebius function Find chromatic polynomials I have typed in 4 algorithms already if anyone wants them. They are: NEXPER Finds next permutation on n letters PERMAN Calculates permanent of a matrix NEXSUB Finds next subset of a given set NEXKSB Finds next k-subset of a given set (A k-subset is a subset with k elements). I may be typing in others as the need arises. Let me know (by mail) if anyone types in any others.
| T.R | Title | User | Personal Name | Date | Lines |
|---|---|---|---|---|---|
| 5.1 | METOO::YARBROUGH | Thu Feb 16 1984 09:39 | 10 | ||
I have also typed in a few of the N&W algorithms, and will make them available to whomever needs them. I have been rephrasing the algorithms in a GOTO-frre form (using FLECS and/or FORTRAN-77) because I think it helps in understanding what's going on in that form. The ones I have include RANPAR (random Partition of an N-set) and NXKSRD (Next k-subset of an N-set, using a Revolving-door algorithm). Others as I get the time to work on them. Lynn Yarbrough | |||||