Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference17 articles.
1. Network Flows;Ahuja,1993
2. G.S. Brodal, Worst-case efficient priority queues, in: Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms (SODA), 1996, pp. 52–58.
3. G.S. Brodal, S. Chaudhuri, J. Radhakrishnan, The randomized complexity of maintaining the minimum, in: Algorithm Theory (SWAT’96), Lecture Notes in Computer Science, vol. 1097, 1996, pp. 4–15.
4. S. Dutt, New faster Kernighan–Lin-type graph-partitioning algorithms, in: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1993, pp. 370–377.
5. C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, in: 19th ACM/IEEE Design Automation Conference (DAC), 1982, pp. 175–181.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献