Pages that link to "Item:Q549673"

The following pages link to Treewidth computations. II. Lower bounds (Q549673):

Displaying 26 items.

• Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• Treewidth distance on phylogenetic trees (Q1637220) (← links)
• A combinatorial Li-Yau inequality and rational points on curves (Q2255277) (← links)
• A sequential reduction method for inference in generalized linear mixed models (Q2259531) (← links)
• Graphs of gonality three (Q2278588) (← links)
• Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
• Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
• As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
• Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs (Q5042451) (← links)
• An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
• Computing treewidth on the GPU (Q5111889) (← links)
• Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
• Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
• Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
• Minimum size tree-decompositions (Q5916057) (← links)
• Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
• (Q6089678) (← links)
• Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width (Q6094029) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
• Locating Eigenvalues of Symmetric Matrices - A Survey (Q6198240) (← links)