I would like to compute the treewidth of a graph. There are really good heuristics for other NP-hard graph problems such as VF2 for subgraph isomorphism, with code available in igraph for example.   I have tried them on my graphs and I find they run very fast for my data.Are there any fast algorithms for treewidth calculation in a similar vein?  
Fast treewidth algorithms
ds.algorithms;graph algorithms;treewidth;heuristics
As far as I know, the state of the art is what is reported inHans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, and Dimitrios M. Thilikos (2012), On exact algorithms for treewidth, ACM Transactions on Algorithms 9 (1): A12, doi:10.1145/2390176.2390188.The methods described there include an implemented $O^*(2^n)$ algorithm with some heuristic optimizations to make it faster in practice.