Agape Library
The Agape library is an open source Java implementation of exponential or parametrized graph algorithms of the literature and developed during the Agape project, a research program funded by the French National Research Agency.
Main algorithms
- chromatic number (O(5.283n))
- minimum directed feedback vertex set (O(1.9977n))
- maximum independent set (O(1.2201n))
- minimum vertex cover (O(1.33k))
- minimal ab-separators (O(n3))
A precise description of all implemented algorithms can be found in RR-2012-01.
Download
02/07/2014:
Various bugs have been fixed in MVC, DFVS (thanks to Steven Kelk). A new coloring algorithm has been added.
- Agape library: agape-0.4.jar
- Dependencies: dependencies-0.2.zip
- Agape command line interface: agapeCL-0.4.jar
- Graph editor: editor-0.4.jar
27/01/2012:
- Agape library: agape-0.3.jar
- Dependencies: dependencies-0.1.zip
- Agape command line interface: agapeCL-0.3.jar
- Graph editor: editor-0.3.jar
All versions can be found on the DownloadAgape page.
The SVN trunk can be anonymously downloaded (use the "anonymous" password for user "anonymous"):
svn checkout --username anonymous https://traclifo.univ-orleans.fr/svn/Agape/trunk/AGAPE
Documentation
- Step by step EclipseInstallation
- Agape library javadoc
Technical publications
- RR-2012-01: Implementation of exponential and parametrized algorithms in the AGAPE project
- RR-2011-15: ANR AGAPE - Implémentation d'algorithmes exacts pour le problème du stable maximum
- RR-2011-16: ANR AGAPE - Implémentation du problème de couverture minimum et applications d'algorithmes exacts paramétrés aux graphes aléatoires
Official website of ANR Agape
http://www-sop.inria.fr/mascotte/Contrats/AGAPE/
License
This software is governed by the CeCILL license under French law and abiding by the rules of distribution of free software.