Releases: mabseher/htd
htd 1.2.0
htd 1.1.0
First official update of htd.
Changes since v1.0.1:
- Additional algorithm for vertex elimination orderings
htd::EnhancedMaximumCardinalitySearchOrderingAlgorithm
(MCS-M)
- Various classes for computing decompositions based on graph separators
- Width-sensitive preprocessing of graphs and hypergraphs
- Performance improvements
htd 1.1 (rc1-bugfix)
This is a bugfix release of htd 1.1-rc1.
Changes since v1.1-rc1:
- Bugfixes
htd 1.1 (rc1)
This is the first release candidate of htd 1.1.
Changes since v1.0.1:
- Added possibility for the preprocessing of input graphs.
htd 1.0.1
htd 1.0.0
htd 1.0.0 (beta1)
This is the first beta version of htd 1.0.0.
Changes since v0.9.9:
- Easy and more minimization of decomposition width
- New class
htd::WidthMinimizingTreeDecompositionAlgorithm
for optimization using a single base algorithm - New class
htd::CombinedWidthMinimizingTreeDecompositionAlgorithm
for optimization using multiple base algorithms
- New class
- Performance improvements
htd 0.9.9
This version of htd is the first release officially supporting optimization of tree decompositions.
Changes since v0.9.5:
- Optimization of tree decomposition
- New class
htd::TreeDecompositionOptimizationOperation
for selection optimal root node - New class
htd::IterativeImprovementTreeDecompositionAlgorithm
for iterative optimization
- New class
- Performance improvements
- Reduced memory usage
First beta of htd
This is the first beta version of htd.
This version of htd contains bugfixes, performance improvements as well as new and extended functionality. This beta release also contains the command-line frontend htd_main. Please note that htd_main is still far from being complete and that it currently only covers a small subset of the functionality of htd like computing tree and hypertree decompositions of input graphs.
Alpha version of htd
This is the alpha version of htd.
Basic interfaces should be stable now, but minor changes might still be necessary.
A remark for those using the possibility to compute path decompositions and hypertree decompositions via htd: Both functionalities are already implemented but they are currently not fully optimized, so further improvements can be expected for the final release.