Skip to main content
5 votes

Have fixed parameter integer program algorithms ever been implemented for research use?

The original algorithm of Lenstra (from 1983) has not been implemented AFAIK. Certainly, no open-source code is known to be available. Lovasz and Scarf proposed (in 1992) a generalized basis ...
kbala's user avatar
  • 326
5 votes
Accepted

Are there any implementations of a graph crossing algorithm?

A slow brute-force implementation of the graph crossing number was added to Sage in Sage Trac ticket 24216: Add crossing number of a graph Github issue: Add crossing number of a graph #24216 which ...
Samuel Lelièvre's user avatar
5 votes

Program for computing Tree decomposition of a graph

LibTW can still be found. It's at http://www.treewidth.com/treewidth/ .
Mathijs's user avatar
  • 161
5 votes

Program for computing Tree decomposition of a graph

For $n\le150$ you can use the webservice over at http://treedecompositions.com/ to directly obtain and visualize a quick and reasonable decomposition, without having to compile or install anything.
Fasermaler's user avatar
4 votes
Accepted

Practical approaches to solving whether programs will halt

Yes, an example of a system that performs this task is T2. It does not solve the halting problem but instead it only attempts to solve certain special cases. A overview is at https://en.wikipedia.org/...
Joshua Herman's user avatar
3 votes

#SAT Solver download

The website BeyondNP contains a good inventory of the existing tools to solve #SAT (and other related hard problems on CNF formulas). You may also find a list of tools for approximate model counting ...
holf's user avatar
  • 2,174
2 votes

Program for computing Tree decomposition of a graph

You may also be interested in the more modern algorithms FlowCutter (GitHub) and the algorithms by Tamaki et al. (GitHub)
delete000's user avatar
  • 828
2 votes

Solver for uniform matroid isomorphism

You can get a square-root speed-up with a time-space tradeoff if you are working in $\mathbb{F}_2$. The matrix $M$ is a no-instance iff there exists a non-zero vector $v$ of Hamming weight $\le k$ (i....
D.W.'s user avatar
  • 12.2k
1 vote

Constructing Orbits of the Automorphism of a Graph Group in Bliss

If Bliss is not mandatory, you can try Sage: https://www.sagemath.org/ I used it successfully a few times. This video: https://www.youtube.com/watch?v=X4_4Bqj6EdA&t=579s Gives a usage example.
Avi Tal's user avatar
  • 1,606
1 vote

#SAT Solver download

Here is one called tensorCSP and based on a tool called tensor networks. It is explained in this paper.
delete000's user avatar
  • 828

Only top scored, non community-wiki answers of a minimum length are eligible