The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Index (complete) Dijkstra's algorithm, , DIMACS, , DIMACS Challenge data DIMACS Implementation Challenge, , , , , Dinic's algorithm directed acyclic graph, , , directed cycle directed graph directed graphs - automata directory file structures disclaimer discrete event simulation, Discrete Fourier Transform, discrete mathematics software discussion section disjoint paths disjoint set union disjoint subsets disjunctive networks disjunctive normal form, disk access disk drives, dispatching emergency vehicles, dispersion problems distance graph distance metrics distinguishable elements distributed computation distribution sort, divide and conquer, , , , division, DNA DNA sequence comparisons DNA sequencing, , file:///E|/BOOK/BOOK5/INDEX_AL.HTM (14 of 56) [19/1/2003 1:33:44]
Index (complete) dominance orderings, DOS file names double-precision arithmetic, , Douglas-Plucker algorithm drawing graphs - related problems Drawing Graphs Nicely drawing puzzles Drawing Trees drawing trees - related problems, driving time minimization drug discovery DSATUR dual graph, duality, duality transformations duplicate elimination duplicate elimination - graphs duplicate elimination - permutations duplicate keys dynamic convex hulls dynamic data structures, dynamic graph algorithms dynamic Huffman codes dynamic programming, , , , , , , dynamic programming - applications, , dynamic programming - initialization dynamic programming - shortest paths dynamic programming - space efficiency eavesdropper eccentricity of a graph economics - applications to edge/vertex connectivity - related problems, , Edge and Vertex Connectivity edge chromatic number edge coloring, file:///E|/BOOK/BOOK5/INDEX_AL.HTM (15 of 56) [19/1/2003 1:33:44]
- 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
- Page 735 and 736: Index R ranking combinatorial objec
- Page 737 and 738: Index S Up: Index - All Index: S s-
- Page 739 and 740: Index S Shape Similarity shape simp
- Page 741 and 742: Index S solar year Solving Linear E
- Page 743 and 744: Index S straight-line graph drawing
- Page 745 and 746: Index T Up: Index - All Index: T ta
- Page 747 and 748: Index T trees - matching trees - pa
- Page 749 and 750: Index V Up: Index - All Index: V va
- Page 751 and 752: Index W Up: Index - All Index: W wa
- Page 753 and 754: Index Y Up: Index - All Index: Y Yo
- Page 755 and 756: Index (complete) Up: Index - All In
- Page 757 and 758: Index (complete) arm, robot around
- Page 759 and 760: Index (complete) binary search tree
- Page 761 and 762: Index (complete) center vertex, , C
- Page 763 and 764: Index (complete) compaction compari
- Page 765 and 766: Index (complete) counting paths, co
- Page 767: Index (complete) deletion from bina
- Page 771 and 772: Index (complete) English to French
- Page 773 and 774: Index (complete) file directory tre
- Page 775 and 776: Index (complete) geom.bib, geometri
- Page 777 and 778: Index (complete) Hamiltonian Cycle
- Page 779 and 780: Index (complete) implementation cha
- Page 781 and 782: Index (complete) job-shop schedulin
- Page 783 and 784: Index (complete) linear programming
- Page 785 and 786: Index (complete) , , , , , , , math
- Page 787 and 788: Index (complete) modular arithmetic
- Page 789 and 790: Index (complete) normal distributio
- Page 791 and 792: Index (complete) parallel algorithm
- Page 793 and 794: Index (complete) planar subdivision
- Page 795 and 796: Index (complete) proof of correctne
- Page 797 and 798: Index (complete) regular expression
- Page 799 and 800: Index (complete) self-organizing tr
- Page 801 and 802: Index (complete) sine functions sin
- Page 803 and 804: Index (complete) spring embedding h
- Page 805 and 806: Index (complete) Symbol Technologie
- Page 807 and 808: Index (complete) trial division Tri
- Page 809 and 810: Index (complete) VLSI circuit layou
- Page 811 and 812: 1.4.4 Shortest Path 1.4.4 Shortest
- Page 813 and 814: 1.2.5 Constrained and Unconstrained
- Page 815 and 816: 1.6.4 Voronoi Diagrams 1.6.4 Vorono
- Page 817 and 818: 1.4.7 Eulerian Cycle / Chinese Post
Index (complete)<br />
Dijkstra's algorithm, ,<br />
DIMACS, ,<br />
DIMACS Challenge data<br />
DIMACS Implementation Challenge, , , , ,<br />
Dinic's algorithm<br />
directed acyclic graph, , ,<br />
directed cycle<br />
directed graph<br />
directed graphs - automata<br />
directory file structures<br />
disclaimer<br />
discrete event simulation,<br />
Discrete Fourier Transform,<br />
discrete mathematics software<br />
discussion section<br />
disjoint paths<br />
disjoint set union<br />
disjoint subsets<br />
disjunctive networks<br />
disjunctive normal form,<br />
disk access<br />
disk drives,<br />
dispatching emergency vehicles,<br />
dispersion problems<br />
distance graph<br />
distance metrics<br />
distinguishable elements<br />
distributed computation<br />
distribution sort,<br />
divide and conquer, , , ,<br />
division,<br />
DNA<br />
DNA sequence comparisons<br />
DNA sequencing, ,<br />
file:///E|/BOOK/BOOK5/INDEX_AL.HTM (14 of 56) [19/1/2003 1:33:44]
Change language