Pages that link to "Item:Q967437"

The following pages link to An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437):

Displaying 10 items.

• The root location problem for arc-disjoint arborescences (Q442209) (← links)
• An improved online evacuation strategy from a convex region on grid networks (Q724733) (← links)
• Improved algorithms for the evacuation route planning problem (Q724759) (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
• Robustness of minimum cost arborescences (Q1926648) (← links)
• Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
• Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
• (Q3128904) (← links)
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6606161) (← links)
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6646736) (← links)