Pages that link to "Item:Q1195927"
From MaRDI portal
The following pages link to The weighted maximum independent set problem in permutation graphs (Q1195927):
Displaying 5 items.
- Facets for node packing (Q1278997) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs (Q2574326) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)
