Clustering for faster network simplex pivots

Authors:
David Eppstein
Affiliations:
Department of Information and Computer Science, University of California, Irvine, CA
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

A data structure for dynamic trees

Journal of Computer and System Sciences
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Mathematical Programming: Series A and B
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Improved dual network simplex

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Pivot Strategies for Primal-Simplex Network Codes

Journal of the ACM (JACM)
Fully dynamic biconnectivity in graphs

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Hi-index	0.00