The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Combinatorial Algorithms for Computers and Calculators Next: Algorithms from P to Up: Programs from Books Previous: Handbook of Data Structures Combinatorial Algorithms for Computers and Calculators Nijenhuis and Wilf [NW78] specializes in algorithms for constructing basic combinatorial objects such as permutations, subsets, and partitions. Such algorithms are often very short, but they are hard to locate and usually surprisingly subtle. Fortran programs for all of the algorithms are provided, as well as a discussion of the theory behind each of them. The programs are usually short enough that it is reasonable to translate them directly into a more modern programming language, as I did in writing Combinatorica (see Section ). Both random and sequential generation algorithms are provided. Descriptions of more recent algorithms for several problems, without code, are provided in [Wil89]. These programs are now available from our algorithm repository WWW site. We tracked them down from Neil Sloane, who had them on a magnetic tape, while the original authors did not! In [NW78], Nijenhuis and Wilf set the proper standard of statistically testing the output distribution of each of the random generators to establish that they really appear uniform. We encourage you to do the same before using these programs, to verify that nothing has been lost in transit. Programs Algorithms Mon Jun 2 23:33:50 EDT 1997 file:///E|/BOOK/BOOK5/NODE221.HTM [19/1/2003 1:32:26]
Algorithms from P to NP Next: Computational Geometry in C Up: Programs from Books Previous: Combinatorial Algorithms for Computers Algorithms from P to NP This algorithms text [MS91] distinguishes itself by including Pascal implementations of many algorithms, with careful experimental comparisons of different algorithms for such problems as sorting and minimum spanning tree, and heuristics for the traveling salesman problem. It provides a useful model for how to properly do empirical algorithm analysis. The programs themselves are probably best used as models. Interesting implementations include the eight-queens problem, plus fundamental graph and geometric algorithms. The programs in [MS91] have been made available by anonymous ftp from cs.unm.edu in directory /pub/moret_shapiro. Programs Algorithms Mon Jun 2 23:33:50 EDT 1997 file:///E|/BOOK/BOOK5/NODE222.HTM [19/1/2003 1:32:26]
- Page 617 and 618: Set and String Problems Next: Set C
- Page 619 and 620: Set Cover Next: Set Packing Up: Set
- Page 621 and 622: Set Cover Figure: Hitting set is du
- Page 623 and 624: Set Packing Next: String Matching U
- Page 625 and 626: Set Packing Notes: An excellent exp
- Page 627 and 628: String Matching shouldn't try. Furt
- Page 629 and 630: String Matching and texts, I recomm
- Page 631 and 632: Approximate String Matching This sa
- Page 633 and 634: Approximate String Matching http://
- Page 635 and 636: Text Compression Next: Cryptography
- Page 637 and 638: Text Compression code string. ASCII
- Page 639 and 640: Cryptography Next: Finite State Mac
- Page 641 and 642: Cryptography ● How can I validate
- Page 643 and 644: Cryptography MD5 [Riv92] is the sec
- Page 645 and 646: Finite State Machine Minimization F
- Page 647 and 648: Finite State Machine Minimization S
- Page 649 and 650: Longest Common Substring than edit
- Page 651 and 652: Longest Common Substring include [A
- Page 653 and 654: Shortest Common Superstring Finding
- Page 655 and 656: Software systems Next: LEDA Up: Alg
- Page 657 and 658: LEDA Next: Netlib Up: Software syst
- Page 659 and 660: Netlib Algorithms Mon Jun 2 23:33:5
- Page 661 and 662: The Stanford GraphBase Next: Combin
- Page 663 and 664: Algorithm Animations with XTango Ne
- Page 665 and 666: Programs from Books Next: Discrete
- Page 667: Handbook of Data Structures and Alg
- Page 671 and 672: Algorithms in C++ Next: Data Source
- Page 673 and 674: Textbooks Next: On-Line Resources U
- Page 675 and 676: On-Line Resources Next: Literature
- Page 677 and 678: People Next: Software Up: On-Line R
- Page 679 and 680: Professional Consulting Services Ne
- Page 681 and 682: Index A Up: Index - All Index: A ab
- Page 683 and 684: Index A artists steal ASA ASCII asp
- Page 685 and 686: Index B binary representation - sub
- Page 687 and 688: Index C Up: Index - All Index: C C+
- Page 689 and 690: Index C clustering , , co-NP coding
- Page 691 and 692: Index C consulting services , conta
- Page 693 and 694: Index D Up: Index - All Index: D DA
- Page 695 and 696: Index D Dictionaries dictionaries -
- Page 697 and 698: Index D dynamic programming - appli
- Page 699 and 700: Index E empirical results - heurist
- Page 701 and 702: Index F Up: Index - All Index: F fa
- Page 703 and 704: Index F frequency domain friend-or-
- Page 705 and 706: Index G geometric shortest path , g
- Page 707 and 708: Index H Up: Index - All Index: H ha
- Page 709 and 710: Index H Algorithms Tue Jun 3 11:59:
- Page 711 and 712: Index I independent set - alternate
- Page 713 and 714: Index J Up: Index - All Index: J ji
- Page 715 and 716: Index K Algorithms Tue Jun 3 11:59:
- Page 717 and 718: Index L linear congruential generat
Combinatorial <strong>Algorithm</strong>s for Computers and Calculators<br />
Next: <strong>Algorithm</strong>s from P to Up: Programs from Books Previous: Handbook of Data Structures<br />
Combinatorial <strong>Algorithm</strong>s for Computers and Calculators<br />
Nijenhuis and Wilf [NW78] specializes in algorithms for constructing basic combinatorial objects such<br />
as permutations, subsets, and partitions. Such algorithms are often very short, but they are hard to locate<br />
and usually surprisingly subtle. Fortran programs for all of the algorithms are provided, as well as a<br />
discussion of the theory behind each of them. <strong>The</strong> programs are usually short enough that it is reasonable<br />
to translate them directly into a more modern programming language, as I did in writing Combinatorica<br />
(see Section ). Both random and sequential generation algorithms are provided. Descriptions of more<br />
recent algorithms for several problems, without code, are provided in [Wil89].<br />
<strong>The</strong>se programs are now available from our algorithm repository WWW site. We tracked them down<br />
from Neil Sloane, who had them on a magnetic tape, while the original authors did not! In [NW78],<br />
Nijenhuis and Wilf set the proper standard of statistically testing the output distribution of each of the<br />
random generators to establish that they really appear uniform. We encourage you to do the same before<br />
using these programs, to verify that nothing has been lost in transit.<br />
Programs<br />
<strong>Algorithm</strong>s<br />
Mon Jun 2 23:33:50 EDT 1997<br />
file:///E|/BOOK/BOOK5/NODE221.HTM [19/1/2003 1:32:26]
Change language