Pages that link to "Item:Q3439650"
From MaRDI portal
The following pages link to A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650):
Displaying 4 items.
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)