Pages that link to "Item:Q1391312"
From MaRDI portal
The following pages link to Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312):
Displaying 9 items.
- A data-parallel algorithm for minimum-width tree layout (Q293301) (← links)
- Efficient algorithms for single- and two-layer linear placement of parallel graphs (Q1130417) (← links)
- A parallel algorithm for finding minimum cutsets in reducible graphs (Q1328109) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- A variable neighbourhood search approach to the cutwidth minimization problem (Q2840754) (← links)
- (Q4393289) (← links)
- A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees (Q5283240) (← links)
- Massively Parallel Algorithms for Minimum Cut (Q5855214) (← links)
- Efficient parallel algorithms for some tree layout problems (Q6085718) (← links)