Jdrasil: A Modular Library for Computing Tree Decompositions
暂无分享,去创建一个
[1] Helmut Veith,et al. Encoding Treewidth into SAT , 2009, SAT.
[2] Russell L. Malmberg,et al. Tree decomposition based fast search of RNA structures including pseudoknots in genomes , 2005, 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05).
[3] Matti Järvisalo,et al. SAT-Based Approaches to Treewidth Computation: An Evaluation , 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.
[4] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[5] Robin Thomas,et al. Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.
[6] Gilles Audemard,et al. Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.
[7] B. Intrigila,et al. On the Cop Number of a Graph , 1993 .
[8] Armin Biere. Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 , 2010 .
[9] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[10] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[11] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[12] Stefan Kratsch,et al. Preprocessing for treewidth , 2011 .
[13] Olivier Bailleux,et al. Efficient CNF Encoding of Boolean Cardinality Constraints , 2003, CP.