Pages that link to "Item:Q6066619"

The following pages link to New algorithms for the minimum coloring cut problem (Q6066619):

Displaying 4 items.

• Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
• Colored cut games (Q2087453) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
• On distance graph coloring problems (Q6070499) (← links)