The following pages link to (Q5417668):
Displaying 14 items.
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Planar Digraphs (Q3120437) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Holiest minimum-cost paths and flows in surface graphs (Q5230385) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (Q5495844) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)