Pages that link to "Item:Q5326771"

The following pages link to Simple linear flow decomposition algorithms on trees, circles, and augmented trees (Q5326771):

Displaying 2 items.

• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304) (← links)
• Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)