scientific article
From MaRDI portal
Publication:2816028
zbMath1409.05176MaRDI QIDQ2816028
Stan P. M. van Hoesel, Arie M. C. A. Koster, Hans L. Bodlaender
Publication date: 1 July 2016
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305800782?np=y
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Safe separators for treewidth, Differential geometric treewidth estimation in adiabatic quantum computation, Symbolic techniques in satisfiability solving, Exploiting sparsity for the min \(k\)-partition problem, A SAT Approach to Clique-Width, Algorithms for Propositional Model Counting, A new global algorithm for max-cut problem with chordal sparsity, Tractable cases of the extended global cardinality constraint, Treewidth lower bounds with brambles, Turbocharging treewidth heuristics, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Tree decompositions of graphs: saving memory in dynamic programming, \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions, Tree decomposition and discrete optimization problems: a survey, Treewidth computations. I: Upper bounds, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Algorithms for propositional model counting, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Understanding the scalability of Bayesian network inference using clique tree growth curves, On the maximum cardinality search lower bound for treewidth, Encoding Treewidth into SAT, Heuristic and metaheuristic methods for computing graph treewidth, Finding good tree decompositions by local search, Tree decompositions and social graphs, ProCount: weighted projected model counting with graded project-join trees
