The following pages link to (Q3682206):
Displaying 5 items.
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- A network flow approach to cost allocation for rooted trees (Q3157039) (← links)
- (Q4886100) (← links)