The following pages link to András Frank (Q226797):
Displaying 5 items.
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- Disjoint paths in a rectilinear grid (Q1051655) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- On Integer Multiflow Maximization (Q3128211) (← links)
- Note on the path‐matching formula (Q4798108) (← links)
