Pages that link to "Item:Q1199945"
From MaRDI portal
The following pages link to An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945):
Displayed 11 items.
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- New results on induced matchings (Q1975379) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- The stable set problem and the thinness of a graph (Q2643810) (← links)
- A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)