Pages that link to "Item:Q5301380"

The following pages link to Contraction and Treewidth Lower Bounds (Q5301380):

Displaying 17 items.

• Increasing the minimum degree of a graph by contractions (Q385061) (← links)
• A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
• Treewidth computations. II. Lower bounds (Q549673) (← links)
• Treewidth lower bounds with brambles (Q926284) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
• Neighborhood contraction in graphs (Q1616737) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
• Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
• Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
• Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
• Constructing Brambles (Q3182927) (← links)
• (Q5111296) (← links)
• Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
• Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)