Home
###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.
INDDGO: Integrated Network Decompositions & Dynamic programming for Graph Optimization [(ORNL Technical Report)] (http://info.ornl.gov/sites/publications/Files/Pub36270.pdf)
Parallel Algorithms for Graph Optimization using Tree Decompositions (ORNL Technical Report)
The developers gratefully acknowledge the support of the Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, under contract DE-AC05-00OR22725 with Oak Ridge National Laboratory and the GRAPHS program of the Defense Advanced Research Projects Agency (DARPA). This work was also supported in part by the United States Department of Defense and used resources of the Extreme Scale Systems Center at Oak Ridge National Laboratory.