The following pages link to (Q4708562):
Displaying 5 items.
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- On the role of bottleneck Monge matrices in combinatorial optimization (Q1904608) (← links)
- Fast Combinatorial Algorithm for Tightly Separating Hyperplanes (Q4912422) (← links)
- Fast Algorithms for Pseudoarboricity (Q5232551) (← links)