7 votes

Program for computing Tree decomposition of a graph

If $n \sim 10$ and $k$ is fixed, then you can even afford to go with an XP algorithm like the one we implemented for our Android app. The source code is here: TreewidthInspector, and for instance ...
user avatar
  • 548
5 votes

Program for computing Tree decomposition of a graph

LibTW can still be found. It's at http://www.treewidth.com/treewidth/ .
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.
user avatar
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 ...
user avatar
  • 316
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/...
user avatar
4 votes
Accepted

Is there a tool for finding Nash equilibria in parametric games?

Is there a tool which solves parametric games? Not that I am aware of (I am a co-author of GTE and help with Gambit). The best suggestion I have if you don't find such a tool (and I doubt one exists)...
user avatar
  • 1,713
4 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 which was closed 2018-01-05, and merged in Sage 8.2.beta3.
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 ...
user avatar
  • 1,855
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....
user avatar
  • 10.5k
2 votes

Enumerate all solutions of a SAT problem

I found a more recent (2014) paper on All-SAT at a VLSI conference, so it is definitely geared toward the practical side (which seems in tune with the OP's question here, albeit less so with cstheory....
user avatar
  • 481
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)
user avatar
  • 748
1 vote

#SAT Solver download

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

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