The Algorithm Design Manual

telospub.com......Page 0
The Algorithm Design Manual......Page 1
Preface......Page 3
Acknowledgments......Page 6
Caveat......Page 8
Contents......Page 9
Index......Page 16
The Algorithm Design Manual......Page 17
Lecture Notes -- Analysis of Algorithms......Page 19
The Stony Brook Algorithm Repository......Page 22
Techniques......Page 25
Introduction to Algorithms......Page 28
Data Structures and Sorting......Page 30
Breaking Problems Down......Page 32
Graph Algorithms......Page 34
Combinatorial Search and Heuristic Methods......Page 37
Intractable Problems and Approximations......Page 39
How to Design Algorithms......Page 41
Resources......Page 46
A Catalog of Algorithmic Problems......Page 47
Algorithmic Resources......Page 51
References......Page 52
About this document .........Page 102
Correctness and Efficiency......Page 103
Correctness......Page 104
Efficiency......Page 109
Expressing Algorithms......Page 110
Keeping Score......Page 111
The RAM Model of Computation......Page 112
Best, Worst, and Average-Case Complexity......Page 114
The Big Oh Notation......Page 116
Growth Rates......Page 118
Logarithms......Page 120
Modeling the Problem......Page 123
About the War Stories......Page 126
War Story: Psychic Modeling......Page 128
Exercises......Page 133
Fundamental Data Types......Page 136
Containers......Page 137
Dictionaries......Page 139
Binary Search Trees......Page 141
Priority Queues......Page 144
Specialized Data Structures......Page 146
Sorting......Page 148
Applications of Sorting......Page 149
Approaches to Sorting......Page 151
Data Structures......Page 152
Incremental Insertion......Page 154
Divide and Conquer......Page 155
Randomization......Page 156
Bucketing Techniques......Page 159
War Story: Stripping Triangulations......Page 161
War Story: Mystery of the Pyramids......Page 165
War Story: String \'em Up......Page 169
Exercises......Page 174
Dynamic Programming......Page 178
Fibonacci numbers......Page 180
The Partition Problem......Page 183
Approximate String Matching......Page 188
Longest Increasing Sequence......Page 191
Minimum Weight Triangulation......Page 194
Limitations of Dynamic Programming......Page 196
War Story: Evolution of the Lobster......Page 198
War Story: What\'s Past is Prolog......Page 202
War Story: Text Compression for Bar Codes......Page 206
Divide and Conquer......Page 210
Fast Exponentiation......Page 212
Binary Search......Page 214
Square and Other Roots......Page 215
Exercises......Page 216
The Friendship Graph......Page 220
Data Structures for Graphs......Page 223
War Story: Getting the Graph......Page 225
Traversing a Graph......Page 228
Breadth-First Search......Page 230
Depth-First Search......Page 232
Applications of Graph Traversal......Page 235
Connected Components......Page 236
Tree and Cycle Detection......Page 237
Two-Coloring Graphs......Page 238
Topological Sorting......Page 239
Articulation Vertices......Page 241
Modeling Graph Problems......Page 242
Minimum Spanning Trees......Page 245
Prim\'s Algorithm......Page 247
Kruskal\'s Algorithm......Page 249
Shortest Paths......Page 251
Dijkstra\'s Algorithm......Page 252
All-Pairs Shortest Path......Page 254
War Story: Nothing but Nets......Page 256
War Story: Dialing for Documents......Page 260
Exercises......Page 266
Backtracking......Page 269
Constructing All Subsets......Page 272
Constructing All Permutations......Page 273
Constructing All Paths in a Graph......Page 274
Search Pruning......Page 275
Bandwidth Minimization......Page 277
War Story: Covering Chessboards......Page 280
Heuristic Methods......Page 283
Simulated Annealing......Page 285
Traveling Salesman Problem......Page 288
Maximum Cut......Page 289
Independent Set......Page 290
Circuit Board Placement......Page 291
Neural Networks......Page 292
Genetic Algorithms......Page 294
War Story: Annealing Arrays......Page 296
Parallel Algorithms......Page 300
War Story: Going Nowhere Fast......Page 302
Exercises......Page 304
Problems and Reductions......Page 306
Simple Reductions......Page 308
Hamiltonian Cycles......Page 309
Independent Set and Vertex Cover......Page 311
Clique and Independent Set......Page 313
Satisfiability......Page 315
The Theory of NP-Completeness......Page 317
3-Satisfiability......Page 319
Difficult Reductions......Page 321
Integer Programming......Page 322
Vertex Cover......Page 325
Other NP-Complete Problems......Page 327
The Art of Proving Hardness......Page 329
War Story: Hard Against the Clock......Page 332
Approximation Algorithms......Page 336
Approximating Vertex Cover......Page 338
The Euclidean Traveling Salesman......Page 340
Exercises......Page 343
Data Structures......Page 346
Dictionaries......Page 348
Priority Queues......Page 353
Suffix Trees and Arrays......Page 357
Graph Data Structures......Page 361
Set Data Structures......Page 366
Kd-Trees......Page 370
Numerical Problems......Page 374
Solving Linear Equations......Page 377
Bandwidth Reduction......Page 381
Matrix Multiplication......Page 384
Determinants and Permanents......Page 388
Constrained and Unconstrained Optimization......Page 391
Linear Programming......Page 395
Random Number Generation......Page 400
Factoring and Primality Testing......Page 405
Arbitrary-Precision Arithmetic......Page 409
Knapsack Problem......Page 414
Discrete Fourier Transform......Page 418
Combinatorial Problems......Page 422
Sorting......Page 424
Searching......Page 429
Median and Selection......Page 433
Generating Permutations......Page 436
Generating Subsets......Page 441
Generating Partitions......Page 445
Generating Graphs......Page 449
Calendrical Calculations......Page 454
Job Scheduling......Page 457
Satisfiability......Page 461
Graph Problems: Polynomial-Time......Page 465
Connected Components......Page 467
Topological Sorting......Page 471
Minimum Spanning Tree......Page 474
Shortest Path......Page 478
Transitive Closure and Reduction......Page 483
Matching......Page 487
Eulerian Cycle / Chinese Postman......Page 491
Edge and Vertex Connectivity......Page 495
Network Flow......Page 499
Drawing Graphs Nicely......Page 503
Drawing Trees......Page 507
Planarity Detection and Embedding......Page 510
Graph Problems: Hard Problems......Page 513
Clique......Page 515
Independent Set......Page 518
Vertex Cover......Page 521
Traveling Salesman Problem......Page 524
Hamiltonian Cycle......Page 529
Graph Partition......Page 532
Vertex Coloring......Page 535
Edge Coloring......Page 539
Graph Isomorphism......Page 542
Steiner Tree......Page 546
Feedback Edge/Vertex Set......Page 550
Computational Geometry......Page 553
Robust Geometric Primitives......Page 556
Convex Hull......Page 561
Triangulation......Page 566
Voronoi Diagrams......Page 570
Nearest Neighbor Search......Page 574
Range Search......Page 578
Point Location......Page 581
Intersection Detection......Page 585
Bin Packing......Page 590
Medial-Axis Transformation......Page 594
Polygon Partitioning......Page 597
Simplifying Polygons......Page 600
Shape Similarity......Page 604
Motion Planning......Page 607
Maintaining Line Arrangements......Page 611
Minkowski Sum......Page 615
Set and String Problems......Page 618
Set Cover......Page 620
Set Packing......Page 624
String Matching......Page 627
Approximate String Matching......Page 631
Text Compression......Page 636
Cryptography......Page 640
Finite State Machine Minimization......Page 645
Longest Common Substring......Page 649
Shortest Common Superstring......Page 653
Software systems......Page 656
LEDA......Page 658
Netlib......Page 659
Collected Algorithms of the ACM......Page 661
The Stanford GraphBase......Page 662
Combinatorica......Page 663
Algorithm Animations with XTango......Page 664
Programs from Books......Page 666
Discrete Optimization Algorithms in Pascal......Page 667
Handbook of Data Structures and Algorithms......Page 668
Combinatorial Algorithms for Computers and Calculators......Page 669
Algorithms from P to NP......Page 670
Computational Geometry in C......Page 671
Algorithms in C++......Page 672
Data Sources......Page 673
Textbooks......Page 674
On-Line Resources......Page 676
Literature......Page 677
People......Page 678
Software......Page 679
Professional Consulting Services......Page 680
Index......Page 681
Index A......Page 682
Index B......Page 685
Index C......Page 688
Index D......Page 694
Index E......Page 699
Index F......Page 702
Index G......Page 705
Index H......Page 708
Index I......Page 711
Index J......Page 714
Index K......Page 715
Index L......Page 717
Index M......Page 720
Index N......Page 724
Index O......Page 727
Index P......Page 729
Index Q......Page 734
Index R......Page 735
Index S......Page 738
Index T......Page 746
Index U......Page 749
Index V......Page 750
Index W......Page 752
Index X......Page 753
Index Y......Page 754
Index Z......Page 755
Index (complete)......Page 756
1.4.4 Shortest Path......Page 812
1.2.5 Constrained and Unconstrained Optimization......Page 814
1.6.4 Voronoi Diagrams......Page 816
1.4.7 Eulerian Cycle / Chinese Postman......Page 818
Online Bibliographies......Page 820
About the Book -- The Algorithm Design Manual......Page 821
Copyright and Disclaimers......Page 824
Image Mosaic......Page 825
CD-ROM Installation......Page 826
Thanks!......Page 829
CD-ROM Installation......Page 833
Binary Search in Action......Page 836
About the Video Lectures......Page 841
Postscript version of the lecture notes......Page 842
Algorithm Repository -- Algorithms Courses......Page 843
Lecture 1 - analyzing algorithms......Page 844
Lecture 2 - asymptotic notation......Page 853
Lecture 3 - recurrence relations......Page 863
Lecture 4 - heapsort......Page 873
Lecture 5 - quicksort......Page 887
Lecture 6 - linear sorting......Page 897
Lecture 7 - elementary data structures......Page 904
Lecture 8 - binary trees......Page 917
Lecture 9 - catch up......Page 930
Lecture 10 - tree restructuring......Page 931
Lecture 11 - backtracking......Page 940
Lecture 12 - introduction to dynamic programming......Page 948
Lecture 13 - dynamic programming applications......Page 957
Lecture 14 - data structures for graphs......Page 964
Lecture 15 - DFS and BFS......Page 976
Lecture 16 - applications of DFS and BFS......Page 984
Lecture 17 - minimum spanning trees......Page 989
Lecture 18 - shortest path algorthms......Page 1000
Lecture 19 - satisfiability......Page 1010
Lecture 20 - integer programming......Page 1017
Lecture 21 - vertex cover......Page 1021
Lecture 22 - techniques for proving hardness......Page 1028
Lecture 23 - approximation algorithms and Cook\'s theorem......Page 1035
About this document .........Page 1046
1.1.6 Kd-Trees......Page 1047
1.1.3 Suffix Trees and Arrays......Page 1049
1.5.1 Clique......Page 1051
1.6.2 Convex Hull......Page 1053
Tools and Utilities......Page 1055
Visual Links Index......Page 1056
Interesting Data Files......Page 1083
About the Ratings......Page 1084
1.1 Data Structures......Page 1085
1.2 Numerical Problems......Page 1086
1.3 Combinatorial Problems......Page 1087
1.4 Graph Problems -- polynomial-time problems......Page 1088
1.5 Graph Problems -- hard problems......Page 1089
1.6 Computational Geometry......Page 1090
1.7 Set and String Problems......Page 1091
C++ Language Implementations......Page 1092
C Language Implementations......Page 1093
Pascal Language Implementations......Page 1095
FORTRAN Language Implementations......Page 1096
Mathematica Language Implementations......Page 1097
Lisp Language Implementations......Page 1098
Algorithm Repository -- Most Wanted List......Page 1099
Algorithm Repository -- Citations......Page 1100
Practical Algorithm Design -- User Feedback......Page 1101
Goldberg\'s Network Optimization Codes......Page 1103
LEDA - A Library of Efficient Data Types and Algorithms......Page 1104
Discrete Optimization Methods......Page 1106
Netlib / TOMS -- Collected Algorithms of the ACM......Page 1108
Xtango and Polka Algorithm Animation Systems......Page 1111
Combinatorica......Page 1114
file:///E|/WEBSITE/IMPLEMEN/GRAPHBAS/IMPLEMNT.HTM......Page 1116
1.4.1 Connected Components......Page 1118
1.5.9 Graph Isomorphism......Page 1120
1.2.3 Matrix Multiplication......Page 1122
1.6.14 Motion Planning......Page 1124
1.4.9 Network Flow......Page 1126
1.1.2 Priority Queues......Page 1128
1.5.10 Steiner Tree......Page 1130
1.4.5 Transitive Closure and Reduction......Page 1132
About the Book -- The Algorithm Design Manual......Page 1134
Adaptive Simulated Annealing......Page 1137
Genocop -- Optimization via Genetic Algorithms......Page 1138
1.2.6 Linear Programming......Page 1139
1.2.7 Random Number Generation......Page 1141
1.3.10 Satisfiability......Page 1143
Fortune\'s 2D Voronoi diagram code......Page 1145
Qhull - higher dimensional convex hull program......Page 1146
Joseph O\'Rourke\'s Computational Geometry......Page 1147
1.6.5 Nearest Neighbor Search......Page 1148
1.6.7 Point Location......Page 1150
1.6.10 Medial-Axis Transformation......Page 1152
1.6.3 Triangulation......Page 1154
Nijenhuis and Wilf: Combinatorial Algorithms......Page 1156
1.5.5 Hamiltonian Cycle......Page 1158
1.4.6 Matching......Page 1160
A compendium of NP optimization problems......Page 1162
1.6.9 Bin Packing......Page 1164
1.6.12 Simplifying Polygons......Page 1166
1.6.13 Shape Similarity......Page 1168
1.6.11 Polygon Partitioning......Page 1170
1.4.3 Minimum Spanning Tree......Page 1172
1.6.15 Maintaining Line Arrangements......Page 1174
1.3.7 Generating Graphs......Page 1176
1.2.11 Discrete Fourier Transform......Page 1178
1.5.8 Edge Coloring......Page 1180
1.3.3 Median and Selection......Page 1182
1.3.1 Sorting......Page 1184
Plugins for use with the CDROM......Page 1186
Footnotes......Page 1187
Implementation Challenges......Page 1188
Implementation Challenges......Page 1189
Implementation Challenges......Page 1190
Implementation Challenges......Page 1191
Implementation Challenges......Page 1192
Implementation Challenges......Page 1193
Caveats......Page 1194
1.1.1 Dictionaries......Page 1195
1.1.4 Graph Data Structures......Page 1197
1.1.5 Set Data Structures......Page 1199
1.2.1 Solving Linear Equations......Page 1201
1.2.2 Bandwidth Reduction......Page 1203
1.2.4 Determinants and Permanents......Page 1205
1.2.8 Factoring and Primality Testing......Page 1207
1.2.9 Arbitrary Precision Arithmetic......Page 1209
1.2.10 Knapsack Problem......Page 1211
1.3.2 Searching......Page 1213
1.3.4 Generating Permutations......Page 1215
1.3.5 Generating Subsets......Page 1217
1.3.6 Generating Partitions......Page 1219
1.3.8 Calendrical Calculations......Page 1221
1.3.9 Job Scheduling......Page 1223
1.4.2 Topological Sorting......Page 1225
1.4.8 Edge and Vertex Connectivity......Page 1227
1.4.10 Drawing Graphs Nicely......Page 1229
1.4.11 Drawing Trees......Page 1231
1.4.12 Planarity Detection and Embedding......Page 1233
1.5.2 Independent Set......Page 1235
1.5.3 Vertex Cover......Page 1237
1.5.4 Traveling Salesman Problem......Page 1239
1.5.6 Graph Partition......Page 1241
1.5.7 Vertex Coloring......Page 1243
1.5.11 Feedback Edge/Vertex Set......Page 1245
1.6.1 Robust Geometric Primitives......Page 1247
1.6.6 Range Search......Page 1249
1.6.8 Intersection Detection......Page 1251
1.6.16 Minkowski Sum......Page 1253
1.7.1 Set Cover......Page 1255
1.7.2 Set Packing......Page 1257
1.7.3 String Matching......Page 1259
1.7.4 Approximate String Matching......Page 1261
1.7.5 Text Compression......Page 1263
1.7.6 Cryptography......Page 1265
1.7.7 Finite State Machine Minimization......Page 1267
1.7.8 Longest Common Substring......Page 1269
1.7.9 Shortest Common Superstring......Page 1271
Handbook of Algorithms and Data Structures......Page 1273
Moret and Shapiro\'s Algorithms P to NP......Page 1275
Index A......Page 1277
Index B......Page 1278
Index C......Page 1280
Index D......Page 1281
Index E......Page 1282
Index F......Page 1283
Index G......Page 1284
Index H......Page 1285
Index I......Page 1286
Index K......Page 1287
Index L......Page 1288
Index M......Page 1289
Index N......Page 1290
Index O......Page 1291
Index P......Page 1292
Index Q......Page 1293
Index R......Page 1294
Index S......Page 1295
Index T......Page 1297
Index U......Page 1298
Index V......Page 1299
Index W......Page 1300
Index (complete)......Page 1301
file:///E|/SOUNDS/LEC1_7.HTM......Page 1309
file:///E|/SOUNDS/LEC1_8.HTM......Page 1310
file:///E|/SOUNDS/LEC1_10.HTM......Page 1311
file:///E|/SOUNDS/LEC1_11.HTM......Page 1312
file:///E|/SOUNDS/LEC1_12.HTM......Page 1313
file:///E|/SOUNDS/LEC1_13.HTM......Page 1314
file:///E|/SOUNDS/LEC1_14.HTM......Page 1315
file:///E|/SOUNDS/LEC1_15.HTM......Page 1316
file:///E|/SOUNDS/LEC2_1.HTM......Page 1317
file:///E|/SOUNDS/LEC2_2.HTM......Page 1318
file:///E|/SOUNDS/LEC2_3.HTM......Page 1319
file:///E|/SOUNDS/LEC2_4.HTM......Page 1320
file:///E|/SOUNDS/LEC2_5.HTM......Page 1321
file:///E|/SOUNDS/LEC2_6.HTM......Page 1322
file:///E|/SOUNDS/LEC2_7.HTM......Page 1323
file:///E|/SOUNDS/LEC2_8.HTM......Page 1324
file:///E|/SOUNDS/LEC2_9.HTM......Page 1325
file:///E|/SOUNDS/LEC2_10.HTM......Page 1326
file:///E|/SOUNDS/LEC2_11.HTM......Page 1327
file:///E|/SOUNDS/LEC2_12.HTM......Page 1328
file:///E|/SOUNDS/LEC2_13.HTM......Page 1329
file:///E|/SOUNDS/LEC2_14.HTM......Page 1330
file:///E|/SOUNDS/LEC2_15.HTM......Page 1331
file:///E|/SOUNDS/LEC3_1.HTM......Page 1332
file:///E|/SOUNDS/LEC3_2.HTM......Page 1333
file:///E|/SOUNDS/LEC3_3.HTM......Page 1334
file:///E|/SOUNDS/LEC3_4.HTM......Page 1335
file:///E|/SOUNDS/LEC3_5.HTM......Page 1336
file:///E|/SOUNDS/LEC3_6.HTM......Page 1337
file:///E|/SOUNDS/LEC3_7.HTM......Page 1338
file:///E|/SOUNDS/LEC3_8.HTM......Page 1339
file:///E|/SOUNDS/LEC3_9.HTM......Page 1340
file:///E|/SOUNDS/LEC3_10.HTM......Page 1341
file:///E|/SOUNDS/LEC3_11.HTM......Page 1342
file:///E|/SOUNDS/LEC3_12.HTM......Page 1343
file:///E|/SOUNDS/LEC3_13.HTM......Page 1344
file:///E|/SOUNDS/LEC3_14.HTM......Page 1345
file:///E|/SOUNDS/LEC4_1.HTM......Page 1346
file:///E|/SOUNDS/LEC4_2.HTM......Page 1347
file:///E|/SOUNDS/LEC4_3.HTM......Page 1348
file:///E|/SOUNDS/LEC4_4.HTM......Page 1349
file:///E|/SOUNDS/LEC4_5.HTM......Page 1350
file:///E|/SOUNDS/LEC4_6.HTM......Page 1351
file:///E|/SOUNDS/LEC4_8.HTM......Page 1352
file:///E|/SOUNDS/LEC4_9.HTM......Page 1353
file:///E|/SOUNDS/LEC4_10.HTM......Page 1354
file:///E|/SOUNDS/LEC4_11.HTM......Page 1355
file:///E|/SOUNDS/LEC4_12.HTM......Page 1356
file:///E|/SOUNDS/LEC4_14.HTM......Page 1357
file:///E|/SOUNDS/LEC4_15.HTM......Page 1358
file:///E|/SOUNDS/LEC4_16.HTM......Page 1359
file:///E|/SOUNDS/LEC4_17.HTM......Page 1360
file:///E|/SOUNDS/LEC4_19.HTM......Page 1361
file:///E|/SOUNDS/LEC4_20.HTM......Page 1362
file:///E|/SOUNDS/LEC4_22.HTM......Page 1363
file:///E|/SOUNDS/LEC5_1.HTM......Page 1364
file:///E|/SOUNDS/LEC5_2.HTM......Page 1365
file:///E|/SOUNDS/LEC5_3.HTM......Page 1366
file:///E|/SOUNDS/LEC5_4.HTM......Page 1367
file:///E|/SOUNDS/LEC5_5.HTM......Page 1368
file:///E|/SOUNDS/LEC5_6.HTM......Page 1369
file:///E|/SOUNDS/LEC5_7.HTM......Page 1370
file:///E|/SOUNDS/LEC5_8.HTM......Page 1371
file:///E|/SOUNDS/LEC5_9.HTM......Page 1372
file:///E|/SOUNDS/LEC5_10.HTM......Page 1373
file:///E|/SOUNDS/LEC5_11.HTM......Page 1374
file:///E|/SOUNDS/LEC5_12.HTM......Page 1375
file:///E|/SOUNDS/LEC5_13.HTM......Page 1376
file:///E|/SOUNDS/LEC5_14.HTM......Page 1377
file:///E|/SOUNDS/LEC5_15.HTM......Page 1378
file:///E|/SOUNDS/LEC6_1.HTM......Page 1379
file:///E|/SOUNDS/LEC6_2.HTM......Page 1380
file:///E|/SOUNDS/LEC6_3.HTM......Page 1381
file:///E|/SOUNDS/LEC6_4.HTM......Page 1382
file:///E|/SOUNDS/LEC6_5.HTM......Page 1383
file:///E|/SOUNDS/LEC6_6.HTM......Page 1384
file:///E|/SOUNDS/LEC6_7.HTM......Page 1385
file:///E|/SOUNDS/LEC6_8.HTM......Page 1386
file:///E|/SOUNDS/LEC6_10.HTM......Page 1387
file:///E|/SOUNDS/LEC6_11.HTM......Page 1388
file:///E|/SOUNDS/LEC6_12.HTM......Page 1389
file:///E|/SOUNDS/LEC7_1.HTM......Page 1390
file:///E|/SOUNDS/LEC7_2.HTM......Page 1391
file:///E|/SOUNDS/LEC7_3.HTM......Page 1392
file:///E|/SOUNDS/LEC7_4.HTM......Page 1393
file:///E|/SOUNDS/LEC7_5.HTM......Page 1394
file:///E|/SOUNDS/LEC7_6.HTM......Page 1395
file:///E|/SOUNDS/LEC7_7.HTM......Page 1396
file:///E|/SOUNDS/LEC7_8.HTM......Page 1397
file:///E|/SOUNDS/LEC7_9.HTM......Page 1398
file:///E|/SOUNDS/LEC7_10.HTM......Page 1399
file:///E|/SOUNDS/LEC7_11.HTM......Page 1400
file:///E|/SOUNDS/LEC7_13.HTM......Page 1401
file:///E|/SOUNDS/LEC7_14.HTM......Page 1402
file:///E|/SOUNDS/LEC7_15.HTM......Page 1403
file:///E|/SOUNDS/LEC7_16.HTM......Page 1404
file:///E|/SOUNDS/LEC7_17.HTM......Page 1405
file:///E|/SOUNDS/LEC7_18.HTM......Page 1406
file:///E|/SOUNDS/LEC7_19.HTM......Page 1407
file:///E|/SOUNDS/LEC8_1.HTM......Page 1408
file:///E|/SOUNDS/LEC8_2.HTM......Page 1409
file:///E|/SOUNDS/LEC8_3.HTM......Page 1410
file:///E|/SOUNDS/LEC8_4.HTM......Page 1411
file:///E|/SOUNDS/LEC8_5.HTM......Page 1412
file:///E|/SOUNDS/LEC8_6.HTM......Page 1413
file:///E|/SOUNDS/LEC8_7.HTM......Page 1414
file:///E|/SOUNDS/LEC8_8.HTM......Page 1415
file:///E|/SOUNDS/LEC8_9.HTM......Page 1416
file:///E|/SOUNDS/LEC8_10.HTM......Page 1417
file:///E|/SOUNDS/LEC8_12.HTM......Page 1418
file:///E|/SOUNDS/LEC8_13.HTM......Page 1419
file:///E|/SOUNDS/LEC8_14.HTM......Page 1420
file:///E|/SOUNDS/LEC8_15.HTM......Page 1421
file:///E|/SOUNDS/LEC8_16.HTM......Page 1422
file:///E|/SOUNDS/LEC8_17.HTM......Page 1423
file:///E|/SOUNDS/LEC8_18.HTM......Page 1424
file:///E|/SOUNDS/LEC8_19.HTM......Page 1425
file:///E|/SOUNDS/LEC9_1.HTM......Page 1426
file:///E|/SOUNDS/LEC10_1.HTM......Page 1427
file:///E|/SOUNDS/LEC10_2.HTM......Page 1428
file:///E|/SOUNDS/LEC10_3.HTM......Page 1429
file:///E|/SOUNDS/LEC10_4.HTM......Page 1430
file:///E|/SOUNDS/LEC10_5.HTM......Page 1431
file:///E|/SOUNDS/LEC10_6.HTM......Page 1432
file:///E|/SOUNDS/LEC10_7.HTM......Page 1433
file:///E|/SOUNDS/LEC10_8.HTM......Page 1434
file:///E|/SOUNDS/LEC10_9.HTM......Page 1435
file:///E|/SOUNDS/LEC10_10.HTM......Page 1436
file:///E|/SOUNDS/LEC10_11.HTM......Page 1437
file:///E|/SOUNDS/LEC10_12.HTM......Page 1438
file:///E|/SOUNDS/LEC10_13.HTM......Page 1439
file:///E|/SOUNDS/LEC10_14.HTM......Page 1440
file:///E|/SOUNDS/LEC11_2.HTM......Page 1441
file:///E|/SOUNDS/LEC11_3.HTM......Page 1442
file:///E|/SOUNDS/LEC11_4.HTM......Page 1443
file:///E|/SOUNDS/LEC11_5.HTM......Page 1444
file:///E|/SOUNDS/LEC11_6.HTM......Page 1445
file:///E|/SOUNDS/LEC11_7.HTM......Page 1446
file:///E|/SOUNDS/LEC11_8.HTM......Page 1447
file:///E|/SOUNDS/LEC11_9.HTM......Page 1448
file:///E|/SOUNDS/LEC11_11.HTM......Page 1449
file:///E|/SOUNDS/LEC11_12.HTM......Page 1450
file:///E|/SOUNDS/LEC12_4.HTM......Page 1451
file:///E|/SOUNDS/LEC12_5.HTM......Page 1452
file:///E|/SOUNDS/LEC12_1.HTM......Page 1453
file:///E|/SOUNDS/LEC12_6.HTM......Page 1454
file:///E|/SOUNDS/LEC12_9.HTM......Page 1455
file:///E|/SOUNDS/LEC12_10.HTM......Page 1456
file:///E|/SOUNDS/LEC12_11.HTM......Page 1457
file:///E|/SOUNDS/LEC12_12.HTM......Page 1458
file:///E|/SOUNDS/LEC12_13.HTM......Page 1459
file:///E|/SOUNDS/LEC13_3.HTM......Page 1460
file:///E|/SOUNDS/LEC13_4.HTM......Page 1461
file:///E|/SOUNDS/LEC13_5.HTM......Page 1462
file:///E|/SOUNDS/LEC13_6.HTM......Page 1463
file:///E|/SOUNDS/LEC13_10.HTM......Page 1464
file:///E|/SOUNDS/LEC13_9.HTM......Page 1465
file:///E|/SOUNDS/LEC13_11.HTM......Page 1466
file:///E|/SOUNDS/LEC13_1.HTM......Page 1467
file:///E|/SOUNDS/LEC14_5.HTM......Page 1468
file:///E|/SOUNDS/LEC14_6.HTM......Page 1469
file:///E|/SOUNDS/LEC14_7.HTM......Page 1470
file:///E|/SOUNDS/LEC14_8.HTM......Page 1471
file:///E|/SOUNDS/LEC14_9.HTM......Page 1472
file:///E|/SOUNDS/LEC14_10.HTM......Page 1473
file:///E|/SOUNDS/LEC14_11.HTM......Page 1474
file:///E|/SOUNDS/LEC14_1.HTM......Page 1475
file:///E|/SOUNDS/LEC14_2.HTM......Page 1476
file:///E|/SOUNDS/LEC14_3.HTM......Page 1477
file:///E|/SOUNDS/LEC14_4.HTM......Page 1478
file:///E|/SOUNDS/LEC15_1.HTM......Page 1479
file:///E|/SOUNDS/LEC15_2.HTM......Page 1480
file:///E|/SOUNDS/LEC15_3.HTM......Page 1481
file:///E|/SOUNDS/LEC15_4.HTM......Page 1482
file:///E|/SOUNDS/LEC15_5.HTM......Page 1483
file:///E|/SOUNDS/LEC15_6.HTM......Page 1484
file:///E|/SOUNDS/LEC15_7.HTM......Page 1485
file:///E|/SOUNDS/LEC16_2.HTM......Page 1486
file:///E|/SOUNDS/LEC16_3.HTM......Page 1487
file:///E|/SOUNDS/LEC16_4.HTM......Page 1488
file:///E|/SOUNDS/LEC16_5.HTM......Page 1489
file:///E|/SOUNDS/LEC16_6.HTM......Page 1490
file:///E|/SOUNDS/LEC16_8.HTM......Page 1491
file:///E|/SOUNDS/LEC15_8.HTM......Page 1492
file:///E|/SOUNDS/LEC16_10.HTM......Page 1493
file:///E|/SOUNDS/LEC16_11.HTM......Page 1494
file:///E|/SOUNDS/LEC16_12.HTM......Page 1495
file:///E|/SOUNDS/LEC17_3.HTM......Page 1496
file:///E|/SOUNDS/LEC17_4.HTM......Page 1497
file:///E|/SOUNDS/LEC17_5.HTM......Page 1498
file:///E|/SOUNDS/LEC17_6.HTM......Page 1499
file:///E|/SOUNDS/LEC17_8.HTM......Page 1500
file:///E|/SOUNDS/LEC17_9.HTM......Page 1501
file:///E|/SOUNDS/LEC17_10.HTM......Page 1502
file:///E|/SOUNDS/LEC16_1.HTM......Page 1503
file:///E|/SOUNDS/LEC17_1.HTM......Page 1504
file:///E|/SOUNDS/LEC17_7.HTM......Page 1505
file:///E|/SOUNDS/LEC17_12.HTM......Page 1506
file:///E|/SOUNDS/LEC17_13.HTM......Page 1507
file:///E|/SOUNDS/LEC17_14.HTM......Page 1508
file:///E|/SOUNDS/LEC17_16.HTM......Page 1509
file:///E|/SOUNDS/LEC19_4.HTM......Page 1510
file:///E|/SOUNDS/LEC19_5.HTM......Page 1511
file:///E|/SOUNDS/LEC18_2.HTM......Page 1512
file:///E|/SOUNDS/LEC18_3.HTM......Page 1513
file:///E|/SOUNDS/LEC18_4.HTM......Page 1514
file:///E|/SOUNDS/LEC18_5.HTM......Page 1515
file:///E|/SOUNDS/LEC18_6.HTM......Page 1516
file:///E|/SOUNDS/LEC18_8.HTM......Page 1517
file:///E|/SOUNDS/LEC18_9.HTM......Page 1518
file:///E|/SOUNDS/LEC18_10.HTM......Page 1519
file:///E|/SOUNDS/LEC18_11.HTM......Page 1520
file:///E|/SOUNDS/LEC19_6.HTM......Page 1521
file:///E|/SOUNDS/LEC19_7.HTM......Page 1522
file:///E|/SOUNDS/LEC19_8.HTM......Page 1523
file:///E|/SOUNDS/LEC19_9.HTM......Page 1524
file:///E|/SOUNDS/LEC20_7.HTM......Page 1525
file:///E|/SOUNDS/LEC19_1.HTM......Page 1526
file:///E|/SOUNDS/LEC19_3.HTM......Page 1527
file:///E|/SOUNDS/LEC19_10.HTM......Page 1528
file:///E|/SOUNDS/LEC20_1.HTM......Page 1529
file:///E|/SOUNDS/LEC20_2.HTM......Page 1530
file:///E|/SOUNDS/LEC20_3.HTM......Page 1531
file:///E|/SOUNDS/LEC20_4.HTM......Page 1532
file:///E|/SOUNDS/LEC20_5.HTM......Page 1533
file:///E|/SOUNDS/LEC20_8.HTM......Page 1534
file:///E|/SOUNDS/LEC20_9.HTM......Page 1535
file:///E|/SOUNDS/LEC20_10.HTM......Page 1536
file:///E|/SOUNDS/LEC20_11.HTM......Page 1537
file:///E|/SOUNDS/LEC20_12.HTM......Page 1538
file:///E|/SOUNDS/LEC21_7.HTM......Page 1539
file:///E|/SOUNDS/LEC21_8.HTM......Page 1540
file:///E|/SOUNDS/LEC21_9.HTM......Page 1541
file:///E|/SOUNDS/LEC21_10.HTM......Page 1542
file:///E|/SOUNDS/LEC21_11.HTM......Page 1543
file:///E|/SOUNDS/LEC22_2.HTM......Page 1544
file:///E|/SOUNDS/LEC22_3.HTM......Page 1545
file:///E|/SOUNDS/LEC22_4.HTM......Page 1546
file:///E|/SOUNDS/LEC22_5.HTM......Page 1547
file:///E|/SOUNDS/LEC22_10.HTM......Page 1548
file:///E|/SOUNDS/LEC22_7.HTM......Page 1549
file:///E|/SOUNDS/LEC22_8.HTM......Page 1550
file:///E|/SOUNDS/LEC22_9.HTM......Page 1551
file:///E|/SOUNDS/LEC22_6.HTM......Page 1552
file:///E|/SOUNDS/LEC24_2.HTM......Page 1553
file:///E|/SOUNDS/LEC24_3.HTM......Page 1554
file:///E|/SOUNDS/LEC24_4.HTM......Page 1555
file:///E|/SOUNDS/LEC24_5.HTM......Page 1556
file:///E|/SOUNDS/LEC24_6.HTM......Page 1557
file:///E|/SOUNDS/LEC24_7.HTM......Page 1558
file:///E|/SOUNDS/LEC24_8.HTM......Page 1559
file:///E|/SOUNDS/LEC24_9.HTM......Page 1560
file:///E|/SOUNDS/LEC24_10.HTM......Page 1561
file:///E|/SOUNDS/LEC25_1.HTM......Page 1562
file:///E|/SOUNDS/LEC25_2.HTM......Page 1563
file:///E|/SOUNDS/LEC25_3.HTM......Page 1564
file:///E|/SOUNDS/LEC25_4.HTM......Page 1565
file:///E|/SOUNDS/LEC25_5.HTM......Page 1566
file:///E|/SOUNDS/LEC25_6.HTM......Page 1567
file:///E|/SOUNDS/LEC25_7.HTM......Page 1568
file:///E|/SOUNDS/LEC26_2.HTM......Page 1569
file:///E|/SOUNDS/LEC26_3.HTM......Page 1570
file:///E|/SOUNDS/LEC26_4.HTM......Page 1571
file:///E|/SOUNDS/LEC26_5.HTM......Page 1572
file:///E|/SOUNDS/LEC26_6.HTM......Page 1573
file:///E|/SOUNDS/LEC26_7.HTM......Page 1574
file:///E|/SOUNDS/LEC26_8.HTM......Page 1575
file:///E|/SOUNDS/LEC27_2.HTM......Page 1576
file:///E|/SOUNDS/LEC26_1.HTM......Page 1577
file:///E|/SOUNDS/LEC27_3.HTM......Page 1578
file:///E|/SOUNDS/LEC27_4.HTM......Page 1579
file:///E|/SOUNDS/LEC27_5.HTM......Page 1580
file:///E|/SOUNDS/LEC27_6.HTM......Page 1581
file:///E|/SOUNDS/LEC27_1.HTM......Page 1582
file:///E|/SOUNDS/LEC27_7.HTM......Page 1583
file:///E|/SOUNDS/LEC27_8.HTM......Page 1584
file:///E|/SOUNDS/LEC27_9.HTM......Page 1585
Ranger - Nearest Neighbor Search in Higher Dimensions......Page 1586
DIMACS Implementation Challenges......Page 1588
Stony Brook Project Implementations......Page 1591
Neural-Networks for Cliques and Coloring......Page 1592
Clarkson\'s higher dimensional convex hull code......Page 1593
file:///E|/WEBSITE/BIBLIO/TESTDATA/AIRPLANE......Page 1594
file:///E|/WEBSITE/BIBLIO/TESTDATA/PEOPLE_N......Page 1661
SimPack/Sim++ Simulation Toolkit......Page 1725
Fire-Engine and Spare-Parts String and Language Algorithms......Page 1726
Algorithms in C++ -- Sedgewick......Page 1728
Geolab -- Computational Geometry System......Page 1729
Grail: finite automata and regular expressions......Page 1730
Calendrical Calculations......Page 1731
LINK -- Programming and Visualization Environment for Hypergraphs......Page 1732
David Eppstein\'s Knuth-Morris-Pratt Algorithm and Minkowski sum code......Page 1733
GraphViz -- graph layout programs......Page 1734
Mike Trick\'s Graph Coloring Resources......Page 1735
Joe Culberson\'s Graph Coloring Resources......Page 1736
Frank Ruskey\'s Combinatorial Generation Resources......Page 1737
Triangle: A Two-Dimensional Quality Mesh Generator......Page 1738
Arrange - maintainance of arrangements with point location......Page 1739
Linprog -- low dimensional linear programming......Page 1740
LP_SOLVE: Linear Programming Code......Page 1741
PARI - Package for Number Theory......Page 1742
file:///E|/WEBSITE/IMPLEMEN/GRAPHED/IMPLEMEN.HTM......Page 1744
TSP solvers......Page 1745
FFTPACK -- Fourier Transform Library......Page 1746
PHYLIP -- inferring phylogenic trees......Page 1747
Salowe\'s Rectilinear Steiner trees......Page 1748
Skeletonization Software (2-D)......Page 1749
SNNS - Stuttgart Neural Network Simulator......Page 1750
agrep - Approximate General Regular Expression Pattern Matcher......Page 1751
HT/DIG -- image compression codes......Page 1752
CAP -- Contig Assembly Program......Page 1753
Shape similarity testing via turning functions......Page 1754
NAUTY -- Graph Isomorphism......Page 1755
POSIT - Propositional Satisfiability Testbed......Page 1756
BIPM -- Bipartite Matching Codes......Page 1757
GEOMPACK - triangulation and convex decomposition codes......Page 1758
LAPACK and LINPACK -- Linear Algebra PACKages......Page 1759
Mathematica -- Assorted Routines......Page 1760
User Comments......Page 1761
The Algorithm Design Manual......Page 1762