Pages that link to "Item:Q509888"

The following pages link to A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888):

Displaying 10 items.

• The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
• On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
• SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
• A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
• (Q5089227) (← links)
• Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
• (Q6168453) (← links)
• Complexity of maximum cut on interval graphs (Q6174803) (← links)
• Canonical cuts of path powers (Q6641096) (← links)