Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)
Software
·
OSTI ID:1231639
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; 002861MLTPL00
- Version:
- 00
- Programming Language(s):
- Medium: X; OS: Windows Linux Mac OSX, and Unicos/lc supercomputer nodes; Compatibility: Multiplatform
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE
- Contributing Organization:
- Vida Blair Dowling Sullivan Christopher Groer Dinesh Weerapurage
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1231639
- Country of Origin:
- United States
Similar Records
Parallel Algorithms for Graph Optimization using Tree Decompositions
Parallel Algorithms for Graph Optimization using Tree Decompositions
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Technical Report
·
Fri Jun 01 00:00:00 EDT 2012
·
OSTI ID:1231639
Parallel Algorithms for Graph Optimization using Tree Decompositions
Conference
·
Tue Jan 01 00:00:00 EST 2013
·
OSTI ID:1231639
INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization
Technical Report
·
Mon Oct 01 00:00:00 EDT 2012
·
OSTI ID:1231639