Data structures and network algorithms
Data structures and network algorithms
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost flows by double scaling
Mathematical Programming: Series A and B
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On Strong Menger-Connectivity of Star Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On strong Menger-connectivity of star graphs
Discrete Applied Mathematics
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |