The following pages link to (Q4509380):
Displaying 8 items.
- The Menger number of the Cartesian product of graphs (Q628251) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Minimum<i>k</i>-geodetically connected digraphs (Q3157033) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- Towards minimum<i>k</i>-geodetically connected graphs (Q4804165) (← links)
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
