Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Minimizing capacity violations in a transshipment network
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Authentication metric analysis and design
ACM Transactions on Information and System Security (TISSEC)
A generalization of the scaling max-flow algorithm
Computers and Operations Research
Sequential and parallel algorithms for minimum flows
The Korean Journal of Computational & Applied Mathematics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An algorithm for minimum flows
WSEAS Transactions on Computers
Executability of scenarios in Petri nets
Theoretical Computer Science
Decreasing path algorithm for minimum flows: dynamic tree implementations
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Solving maximum flow problems on real-world bipartite graphs
Journal of Experimental Algorithmics (JEA)
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |