Integrated Network Decompositions and 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.
- Short Name / Acronym:
- INDDGO
- Site Accession Number:
- 4984
- Software Type:
- Scientific
- License(s):
- BSD 3-clause "New" or "Revised" License
- Research Organization:
- Oak Ridge National Laboratory
- Sponsoring Organization:
- USDOEPrimary Award/Contract Number:AC05-00OR22725
- DOE Contract Number:
- AC05-00OR22725
- Code ID:
- 2325
- OSTI ID:
- code-2325
- Country of Origin:
- United States
Similar Records
Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)
Parallel Algorithms for Graph Optimization Using Tree Decompositions
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Software
·
Thu May 31 00:00:00 EDT 2012
·
OSTI ID:1231639
Parallel Algorithms for Graph Optimization Using Tree Decompositions
Technical Report
·
Fri Aug 31 20:00:00 EDT 2012
·
OSTI ID:1042920
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Technical Report
·
Mon Oct 01 00:00:00 EDT 2012
·
OSTI ID:1055043