Pages that link to "Item:Q672389"
From MaRDI portal
The following pages link to The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389):
Displaying 5 items.
- Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Paths to stable allocations (Q2329415) (← links)
- Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
- Budget-feasible mechanisms for proportionally selecting agents from groups (Q6080647) (← links)
