The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Index B Up: Index - All Index: B B-tree , , , backpacker backsubstitution backtracking , , , , , , , , , backtracking - animations backtracking - applications , backtracking - bandwidth problem balanced search tree , , banded systems , bandersnatch problem bandwidth , bandwidth - matrix Bandwidth Reduction bandwidth reduction - backtracking bandwidth reduction - related problems bar codes base - arithmetic base - conversion base of logarithm Bellman-Ford algorithm , Berge's theorem best-case complexity Bible - searching the bibliographic databases biconnected components biconnected graphs , , big Oh notation bijection binary heap file:///E|/BOOK/BOOK6/INDEX_B.HTM (1 of 3) [19/1/2003 1:32:36]
Index B binary representation - subsets binary search , , binary search - applications , binary search - one-sided , binary search tree , , , binary search tree - applications binary search tree - computational experience Bin Packing bin packing - applications , bin packing - knapsack problem bin packing - related problems , biocomputing biology bipartite graph bipartite graph recognition bipartite incidence structures bipartite matching , , , bipartite matching - applications , bit-mapped images bit representation of graphs bit vector , , , bit vector - applications , blind man's algorithm block - set partition blossoms board evaluation function bookshelves Boolean logic minimization , Boolean matrix multiplication borrowing Boruvka's algorithm boss's delight boundaries bounded height priority queue file:///E|/BOOK/BOOK6/INDEX_B.HTM (2 of 3) [19/1/2003 1:32:36]
- 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 and 668: Handbook of Data Structures and Alg
- Page 669 and 670: Algorithms from P to NP Next: Compu
- 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: Index A artists steal ASA ASCII asp
- 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
- Page 719 and 720: Index M Up: Index - All Index: M ma
- Page 721 and 722: Index M mindset minima minimax sear
- Page 723 and 724: Index N Up: Index - All Index: N na
- Page 725 and 726: Index N numerical analysis numerica
- Page 727 and 728: Index O overlap graph overpasses -
- Page 729 and 730: Index P , , , , , , , , , , passwor
- Page 731 and 732: Index P polygons polygon triangulat
- Page 733 and 734: Index Q Up: Index - All Index: Q Qh
Index B<br />
Up: Index - All<br />
Index: B<br />
B-tree , , ,<br />
backpacker<br />
backsubstitution<br />
backtracking , , , , , , , , ,<br />
backtracking - animations<br />
backtracking - applications ,<br />
backtracking - bandwidth problem<br />
balanced search tree , ,<br />
banded systems ,<br />
bandersnatch problem<br />
bandwidth ,<br />
bandwidth - matrix<br />
Bandwidth Reduction<br />
bandwidth reduction - backtracking<br />
bandwidth reduction - related problems<br />
bar codes<br />
base - arithmetic<br />
base - conversion<br />
base of logarithm<br />
Bellman-Ford algorithm ,<br />
Berge's theorem<br />
best-case complexity<br />
Bible - searching the<br />
bibliographic databases<br />
biconnected components<br />
biconnected graphs , ,<br />
big Oh notation<br />
bijection<br />
binary heap<br />
file:///E|/BOOK/BOOK6/INDEX_B.HTM (1 of 3) [19/1/2003 1:32:36]
Change language