Implementation of exponential and parametrized algorithms in the AGAPE project

01/28/2012
by   Pascal Berthomé, et al.
0

This technical report describes the implementation of exact and parametrized exponential algorithms, developed during the French ANR Agape during 2010-2012. The developed algorithms are distributed under the CeCILL license and have been written in Java using the Jung graph library.

READ FULL TEXT
research
08/01/2019

Popt4jlib: A Parallel/Distributed Optimization Library for Java

This paper describes the architectural design as well as key implementat...
research
04/05/2023

Spectral Toolkit of Algorithms for Graphs: Technical Report (1)

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source libra...
research
05/01/2015

Automatic Observer Script for StarCraft: Brood War Bot Games (technical report)

This short report describes an automated BWAPI-based script developed fo...
research
08/31/2019

SCALABLE INTERNETWORKING: Final Technical Report

This document describes the work completed at the University of Californ...
research
07/09/2019

Trustworthy Graph Algorithms

The goal of the LEDA project was to build an easy-to-use and extendable ...
research
04/17/2019

JGraphT -- A Java library for graph data structures and algorithms

Mathematical software and graph-theoretical algorithmic packages to effi...
research
01/01/2022

Asymptotic Experiments with Data Structures: Bipartite Graph Matchings and Covers

We consider instances of bipartite graphs and a number of asymptotic per...

Please sign up or login with your details

Forgot password? Click here to reset