The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
LINK -- Programming and Visualization Environment for Hypergraphs LINK -- Programming and Visualization Environment for Hypergraphs LINK is a software system designed to be a general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized. The system (which is still under development) features a full Scheme interpreter with access to the Tk graphics toolkit (STk), a flexible GUI, and a rich variety of important Collection and Graph objects which are grouped into C++ libraries. Link is designed to be useful as an educational tool, as a research tool, and as a prototyping tool for industry. The primary investigators of LINK are: Nathaniel Dean of Lucent / Bell Laboratories, Mark Goldberg of Rensselaer Polytechnic Institute, Greg Shannon of Spanning Tree Technologies, and Steven Skiena of SUNY Stony Brook. The project is currently coordinated by Jonathan Berry, a postdoctoral fellow at DIMACS at Rutgers University and one of LINK's primary designers. The LINK system is freely available for teaching and research. Also within the distribution directory is Jon Berry's implementations of several graph partitioning heuristics, including Kernighan-Lin, Simulated Annealing, and Path Optimization. ● Download Files (local site) ● LINK distribution site at DIMACS ● Jon Berry's graph partitioning heuristics, original site Problem Links ● Graph Partition (8) ● Graph Data Structures (6) ● Set Data Structures (4) About the Book Send us Mail Go to Main Page This page last modified on Dec 18, 1996. file:///E|/WEBSITE/IMPLEMEN/LINK/IMPLEMEN.HTM [19/1/2003 1:40:44]
David Eppstein's Knuth-Morris-Pratt Algorithm and Minkowski sum code David Eppstein's Knuth-Morris-Pratt Algorithm and Minkowski sum code David Eppstein's WWW page http://www.ics.uci.edu/~eppstein/161/kmp/ contains an implementation of the Knuth-Morris-Pratt string matching algorithm in C++. It exists as a teaching example from his algorithms course notes. He also provides a Mathematica code for the Minkowski sum problem in http://www.ics.uci.edu/~eppstein/junkyard/ukraine/ , which computes Minkowski sums of line segments (aka zonotopes). This problem is also closely related to maintaining line arrangements. The program works in any dimension, but doesn't do Minkowski sums of more complicated shapes. ● Link to EPPSTEIN's Knuth-Morris-Pratt Algorithm ● Link to EPPSTEIN's Minkowski sums code in Mathematica ● Download Files (local site) Problem Links ● Minkowski Sum (4) ● String Matching (4) About the Book Send us Mail Go to Main Page This page last modified on Feb 17, 1997. file:///E|/WEBSITE/IMPLEMEN/EPPSTEIN/IMPLEMEN.HTM [19/1/2003 1:40:44]
- Page 1403 and 1404: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1405 and 1406: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1407 and 1408: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1409 and 1410: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1411 and 1412: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1413 and 1414: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1415 and 1416: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1417 and 1418: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1419 and 1420: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1421 and 1422: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1423 and 1424: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1425 and 1426: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1427 and 1428: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1429 and 1430: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1431 and 1432: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1433 and 1434: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1435 and 1436: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1437 and 1438: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1439 and 1440: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1441 and 1442: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1443 and 1444: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1445 and 1446: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1447 and 1448: SimPack/Sim++ Simulation Toolkit Si
- Page 1449 and 1450: Fire-Engine and Spare-Parts String
- Page 1451 and 1452: Geolab -- Computational Geometry Sy
- Page 1453: Calendrical Calculations Calendrica
- Page 1457 and 1458: Mike Trick's Graph Coloring Resourc
- Page 1459 and 1460: Frank Ruskey's Combinatorial Genera
- Page 1461 and 1462: Arrange - maintainance of arrangeme
- Page 1463 and 1464: LP_SOLVE: Linear Programming Code L
- Page 1465 and 1466: PARI - Package for Number Theory Se
- Page 1467 and 1468: TSP solvers TSP solvers tsp-solve i
- Page 1469 and 1470: PHYLIP -- inferring phylogenic tree
- Page 1471 and 1472: Skeletonization Software (2-D) Skel
- Page 1473 and 1474: agrep - Approximate General Regular
- Page 1475 and 1476: CAP -- Contig Assembly Program CAP
- Page 1477 and 1478: NAUTY -- Graph Isomorphism NAUTY --
- Page 1479 and 1480: BIPM -- Bipartite Matching Codes BI
- Page 1481 and 1482: LAPACK and LINPACK -- Linear Algebr
- Page 1483 and 1484: User Comments User Comments Archive
- Page 1485 and 1486: The Algorithm Design Manual Most pr
- Page 1487 and 1488: The Algorithm Design Manual 5.6 War
David Eppstein's Knuth-Morris-Pratt <strong>Algorithm</strong> and Minkowski sum code<br />
David Eppstein's Knuth-Morris-Pratt <strong>Algorithm</strong> and<br />
Minkowski sum code<br />
David Eppstein's WWW page http://www.ics.uci.edu/~eppstein/161/kmp/ contains an implementation of<br />
the Knuth-Morris-Pratt string matching algorithm in C++. It exists as a teaching example from his<br />
algorithms course notes.<br />
He also provides a Mathematica code for the Minkowski sum problem in<br />
http://www.ics.uci.edu/~eppstein/junkyard/ukraine/ , which computes Minkowski sums of line segments<br />
(aka zonotopes). This problem is also closely related to maintaining line arrangements. <strong>The</strong> program<br />
works in any dimension, but doesn't do Minkowski sums of more complicated shapes.<br />
● Link to EPPSTEIN's Knuth-Morris-Pratt <strong>Algorithm</strong><br />
● Link to EPPSTEIN's Minkowski sums code in Mathematica<br />
● Download Files (local site)<br />
Problem Links<br />
● Minkowski Sum (4)<br />
● String Matching (4)<br />
About the Book<br />
Send us Mail<br />
Go to Main Page<br />
This page last modified on Feb 17, 1997.<br />
file:///E|/WEBSITE/IMPLEMEN/EPPSTEIN/IMPLEMEN.HTM [19/1/2003 1:40:44]
Change language