https://github.com/anders-wind/minfill-subexponential

The public repository for the submission of the PACE challenge 2017 B-Track: Minimum Fill-In. The core algorithm is based on Fomin and Villanger's article "Subexponential Parameterized Algorithm for Minimum Fill-In", with a few adjustments for optimization.
https://github.com/anders-wind/minfill-subexponential

Last synced: about 1 year ago
JSON representation

The public repository for the submission of the PACE challenge 2017 B-Track: Minimum Fill-In. The core algorithm is based on Fomin and Villanger's article "Subexponential Parameterized Algorithm for Minimum Fill-In", with a few adjustments for optimization.

• Host: GitHub
• URL: https://github.com/anders-wind/minfill-subexponential
• Owner: anders-wind
• License: mit
• Created: 2017-05-25T18:51:04.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2018-07-17T14:41:36.000Z (almost 8 years ago)
• Last Synced: 2025-06-04T03:51:49.758Z (about 1 year ago)
• Language: Java
• Size: 7.31 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Minimum Fill-In, Subexponentially

*Submitted by Anders Wind (awis@itu.dk) and Mikael Lindemann (mlin@itu.dk)*

The public repository for the submission of the PACE challenge 2017 B-Track: Minimum Fill-In . The core algorithm is based on Fomin and Villanger's article Subexponential Parameterized Algorithm for Minimum Fill-in, with a few adjustments for optimization.

The report can be seen [here](report.pdf)