Author:
Clausen Jens,Larsson Träff Jesper
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference12 articles.
1. J. Clausen and J. Larsson Träff, Parallel graph partitioning using branch-and-bound with dynamic distribution of subproblems, DIKU Report 88/18, J. Comp. Oper. Res. (1988), submitted.
2. J. Clausen and J. Larsson Träff, Do inherently sequential branch-and-bound algorithms exist?, in preparation.
3. A. Goldberg and R.E. Tarjan, A new approach to the maximum-flow problem, J. ACM 35(1988)921–940.
4. B.N. Kernighan and S. Lin, An efficient procedure for partitioning graphs, Bell Sys. Tech. J. 49(1970)291–307.
5. T. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, CACM 27(1984)594–602.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献