Pages that link to "Item:Q672408"
From MaRDI portal
The following pages link to Simple linear time recognition of unit interval graphs (Q672408):
Displaying 5 items.
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
- Corrigendum to: ``Complexity and approximability of the happy set problem'' (Q6076349) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
