The following pages link to (Q4796189):
Displaying 4 items.
- Bounds on mincut for Cayley graphs over Abelian groups (Q733724) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Efficient reassembling of graphs. I: The linear case (Q2359807) (← links)
