Pages that link to "Item:Q2345859"

The following pages link to A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859):

Displaying 5 items.

• Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
• Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
• The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
• A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
• (Q5092370) (← links)