Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm

Robert Endre Tarjan. Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Program., 77:169-177, 1997.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.