Pages that link to "Item:Q948695"

The following pages link to Solving some NP-complete problems using split decomposition (Q948695):

Displaying 10 items.

• Between treewidth and clique-width (Q300479) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• Distance-hereditary comparability graphs (Q1759843) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• Between Treewidth and Clique-Width (Q2945207) (← links)
• Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
• Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way (Q3010409) (← links)
• (Q5091021) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)