Pages that link to "Item:Q1314630"
From MaRDI portal
The following pages link to Parallel algorithms for permutation graphs (Q1314630):
Displaying 18 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Efficient parallel algorithms for permutation graphs (Q1892868) (← links)
- The minimum weight dominating set problem for permutation graphs is in NC (Q1898177) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
- Coloring permutation graphs in parallel (Q2741358) (← links)
- Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)
- (Q3513420) (← links)
- (Q3785968) (← links)
- (Q4222504) (← links)
- Some Efficient Algorithms for Permutation Graphs (Q4290917) (← links)
- (Q4730797) (← links)
- Parallel algorithms for P4-comparability graphs (Q4818673) (← links)
- A permutation parallel algorithm under exchange restriction with message passing interface (Q6051699) (← links)