Pages that link to "Item:Q1210310"
From MaRDI portal
The following pages link to Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310):
Displaying 8 items.
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- The maximum clique problem (Q1318271) (← links)
- Constrained tree inclusion (Q2569419) (← 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)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)