ComputeTW

swMATH11360MaRDI QIDQ23306

No author found.

Related Items (53)

Finding Good Decompositions for Dynamic Programming on Dense Graphs ⋮ As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs ⋮ Algorithms and Complexity for Turaev-Viro Invariants ⋮ Reduction rules for the maximum parsimony distance on phylogenetic trees ⋮ Treewidth distance on phylogenetic trees ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing ⋮ On quasi-planar graphs: clique-width and logical description ⋮ The tree-width of C ⋮ Exploiting sparsity for the min \(k\)-partition problem ⋮ On Low Treewidth Graphs and Supertrees ⋮ On the vertex cover \(P_3\) problem parameterized by treewidth ⋮ Systematic and deterministic graph minor embedding for Cartesian products of graphs ⋮ From tree-decompositions to clique-width terms ⋮ Chordal Networks of Polynomial Ideals ⋮ Courcelle's theorem -- a game-theoretic approach ⋮ Branch decomposition heuristics for linear matroids ⋮ Turbocharging treewidth heuristics ⋮ Adiabatic quantum programming: minor embedding with hard faults ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ Minimum size tree-decompositions ⋮ \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions ⋮ On making a distinguished vertex of minimum degree by vertex deletion ⋮ Treewidth computations. I: Upper bounds ⋮ A combinatorial Li-Yau inequality and rational points on curves ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ A sequential reduction method for inference in generalized linear mixed models ⋮ Treewidth computations. II. Lower bounds ⋮ Boolean-width of graphs ⋮ Phylogenetic incongruence through the lens of Monadic Second Order logic ⋮ On the Boolean-Width of a Graph: Structure and Applications ⋮ Graphs of gonality three ⋮ Complexity of secure sets ⋮ Recognizing hyperelliptic graphs in polynomial time ⋮ Variable neighborhood search for graphical model energy minimization ⋮ A Local Search Algorithm for Branchwidth ⋮ Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth ⋮ Treewidth of display graphs: bounds, brambles and applications ⋮ Algorithms and complexity for Turaev-Viro invariants ⋮ Exploiting sparsity in complex polynomial optimization ⋮ Learning tractable Bayesian networks in the space of elimination orders ⋮ Evaluating Datalog via tree automata and cycluits ⋮ Computing treewidth on the GPU ⋮ Tree decompositions and social graphs ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth ⋮ Customizable Contraction Hierarchies ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness

This page was built for software: ComputeTW