Pages that link to "Item:Q509888"
From MaRDI portal
The following pages link to A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888):
Displaying 5 items.
- 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)
- (Q5089227) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
