The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Combinatorica ● Graph Data Structures (6) ● Determinants and Permanents (4) ● Edge Coloring (4) ● Edge and Vertex Connectivity (4) ● Transitive Closure and Reduction (4) ● Vertex Cover (4) ● Connected Components (3) ● Eulerian Cycle / Chinese Postman (3) ● Graph Isomorphism (3) ● Hamiltonian Cycle (3) ● Matching (3) ● Minimum Spanning Tree (3) ● Network Flow (3) ● Shortest Path (3) ● Topological Sorting (3) ● Traveling Salesman Problem (3) ● Vertex Coloring (3) ● Longest Common Substring (2) ● Planarity Detection and Embedding (2) ● Sorting (2) ● Clique (1) About the Book Send us Mail Go to Main Page This page last modified on Dec 20, 1996. file:///E|/WEBSITE/IMPLEMEN/COMBINAT/IMPLEMEN.HTM (2 of 2) [19/1/2003 1:36:42]
file:///E|/WEBSITE/IMPLEMEN/GRAPHBAS/IMPLEMNT.HTM The Stanford GraphBase The Stanford GraphBase is a collection of programs and datasets which generate and manipulate graphs and networks. This package is the work of Donald Knuth at Stanford University, and the most recent version of this software is always available by anonymous ftp from the Computer Science Department at Stanford (see previous page for link information). The programs themselves are written in CWEB , which is a mix of the C programming language and Knuth's TEX typesetting language. To install and use this package, therefore, it is necessary to first download and install CWEB on your system. We have made CWEB and the GraphBase available on this site, as well as providing links to the original sites. Files in GraphBase which have the .dat extension are data files, including dictionary-type data, map distance data, data for reconstructing the painting of the Mona Lisa, football score data, and so on. Much of the emphasis in the example GraphBase programs is on novel uses for graphs (for instance constructing word ladders: "flour - floor - flood - blood - brood - broad - bread"), while implementing efficient algorithmic methods to manipulate graphs and networks in general. The text The Stanford GraphBase: A Platform for Combinatorial Computing is available from Addison- Wesley Publishing Company (ISBN 0-201-54275-7), and is a helpful overview of the system. This book shows the recreational approach of the author to the field of algorithms while providing a useful GraphBase reference. ● Download GraphBase Files (Stanford site) ● Download CWEB Files (Stanford site) ● Download GraphBase and CWEB files (local site) ● Go to Stanford Computer Science Home Page Problem Links ● Generating Graphs (10) ● Graph Data Structures (6) ● Random Number Generation (6) ● Generating Partitions (5) ● Generating Permutations (5) ● Connected Components (4) ● Edge and Vertex Connectivity (4) file:///E|/WEBSITE/IMPLEMEN/GRAPHBAS/IMPLEMNT.HTM (1 of 2) [19/1/2003 1:36:43]
- Page 1063 and 1064: Visual Links Index file:///E|/WEBSI
- Page 1065 and 1066: Visual Links Index file:///E|/WEBSI
- Page 1067 and 1068: Visual Links Index file:///E|/WEBSI
- Page 1069 and 1070: Visual Links Index file:///E|/WEBSI
- Page 1071 and 1072: Visual Links Index file:///E|/WEBSI
- Page 1073 and 1074: Visual Links Index file:///E|/WEBSI
- Page 1075 and 1076: Visual Links Index file:///E|/WEBSI
- Page 1077 and 1078: Visual Links Index file:///E|/WEBSI
- Page 1079 and 1080: Visual Links Index file:///E|/WEBSI
- Page 1081 and 1082: Visual Links Index file:///E|/WEBSI
- Page 1083 and 1084: About the Ratings About the Ratings
- Page 1085 and 1086: 1.2 Numerical Problems 1.2 Numerica
- Page 1087 and 1088: 1.4 Graph Problems -- polynomial-ti
- Page 1089 and 1090: 1.6 Computational Geometry 1.6 Comp
- Page 1091 and 1092: C++ Language Implementations Algori
- Page 1093 and 1094: C Language Implementations ● POSI
- Page 1095 and 1096: FORTRAN Language Implementations Al
- Page 1097 and 1098: Lisp Language Implementations Algor
- Page 1099 and 1100: Algorithm Repository -- Citations C
- Page 1101 and 1102: Practical Algorithm Design -- User
- Page 1103 and 1104: LEDA - A Library of Efficient Data
- Page 1105 and 1106: Discrete Optimization Methods Discr
- Page 1107 and 1108: Netlib / TOMS -- Collected Algorith
- Page 1109 and 1110: Netlib / TOMS -- Collected Algorith
- Page 1111 and 1112: Xtango and Polka Algorithm Animatio
- Page 1113: Combinatorica Combinatorica Combina
- Page 1117 and 1118: 1.4.1 Connected Components 1.4.1 Co
- Page 1119 and 1120: 1.5.9 Graph Isomorphism 1.5.9 Graph
- Page 1121 and 1122: 1.2.3 Matrix Multiplication 1.2.3 M
- Page 1123 and 1124: 1.6.14 Motion Planning 1.6.14 Motio
- Page 1125 and 1126: 1.4.9 Network Flow 1.4.9 Network Fl
- Page 1127 and 1128: 1.1.2 Priority Queues 1.1.2 Priorit
- Page 1129 and 1130: 1.5.10 Steiner Tree 1.5.10 Steiner
- Page 1131 and 1132: 1.4.5 Transitive Closure and Reduct
- Page 1133 and 1134: About the Book -- The Algorithm Des
- Page 1135 and 1136: About the Book -- The Algorithm Des
- Page 1137 and 1138: Genocop -- Optimization via Genetic
- Page 1139 and 1140: 1.2.6 Linear Programming ● Knapsa
- Page 1141 and 1142: 1.2.7 Random Number Generation ●
- Page 1143 and 1144: 1.3.10 Satisfiability ● Constrain
- Page 1145 and 1146: Qhull - higher dimensional convex h
- Page 1147 and 1148: 1.6.5 Nearest Neighbor Search 1.6.5
- Page 1149 and 1150: 1.6.7 Point Location 1.6.7 Point Lo
- Page 1151 and 1152: 1.6.10 Medial-Axis Transformation 1
- Page 1153 and 1154: 1.6.3 Triangulation 1.6.3 Triangula
- Page 1155 and 1156: Nijenhuis and Wilf: Combinatorial A
- Page 1157 and 1158: 1.5.5 Hamiltonian Cycle 1.5.5 Hamil
- Page 1159 and 1160: 1.4.6 Matching 1.4.6 Matching INPUT
- Page 1161 and 1162: A compendium of NP optimization pro
- Page 1163 and 1164: 1.6.9 Bin Packing 1.6.9 Bin Packing
Combinatorica<br />
● Graph Data Structures (6)<br />
● Determinants and Permanents (4)<br />
● Edge Coloring (4)<br />
● Edge and Vertex Connectivity (4)<br />
● Transitive Closure and Reduction (4)<br />
● Vertex Cover (4)<br />
● Connected Components (3)<br />
● Eulerian Cycle / Chinese Postman (3)<br />
● Graph Isomorphism (3)<br />
● Hamiltonian Cycle (3)<br />
● Matching (3)<br />
● Minimum Spanning Tree (3)<br />
● Network Flow (3)<br />
● Shortest Path (3)<br />
● Topological Sorting (3)<br />
● Traveling Salesman Problem (3)<br />
● Vertex Coloring (3)<br />
● Longest Common Substring (2)<br />
● Planarity Detection and Embedding (2)<br />
● Sorting (2)<br />
● Clique (1)<br />
About the Book<br />
Send us Mail<br />
Go to Main Page<br />
This page last modified on Dec 20, 1996.<br />
file:///E|/WEBSITE/IMPLEMEN/COMBINAT/IMPLEMEN.HTM (2 of 2) [19/1/2003 1:36:42]