swMATH ID: 23104
Software Authors: Groer C, Sullivan BD, Weerapurage D
Description: Integrated Network Decompositions & Dynamic programming for Graph Optimization (INDDGO). The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.
Homepage: https://github.com/bdsullivan/inddgo/wiki
Source Code:  https://github.com/bdsullivan/inddgo/wiki
Related Software: GitHub; ComputeTW; SparseMatrix; Pajek; AMD; Gravisto; PARAssign; WhatsHap; MetaCrop; BioMiner; Bioconductor; Numbat; MG-RAST; TreeWiz; CIRCUS; igraph; GenABEL; ViennaRNA; QAPgrid; IgTree
Cited in: 2 Publications

Citations by Year