------------------------------------
We are proud to announce the release our framework KaLP (Karlsruhe
Longest Paths) to compute longest paths in undirected weighted networks.
Our optimal algorithm for solving the longest path problem uses dynamic
programming based on partitions of the graph. Our implementation is
significantly faster than other state-of-the-art methods and can solve
more instances. Here we provide the implementation of the algorithm as
easy to use open source software.
The software is released under the GPL 3.0 License.
* open source implementation / website
http://algo2.iti.kit.edu/kalp
We are glad for any comments and error reports (or even bug fixes) that
you send us.
Tomas Balyo, Kai Fieger, and Christian Schulz
Karlsruhe Institute of Technology (KIT) and University of Vienna
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
