Author:
Burlet Michel,Goldschmidt Olivier
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference5 articles.
1. A polynomial time algorithm for thek-cut Problem fork fixed;Goldschmidt;Math. Oper. Res.,1994
2. Computing edge connectivity in multigraphs and capacitated graphs;Nagamochi;SIAM J. Discrete Math.,1992
3. H. Nagamochi, K. Nishimura, T. Ibaraki, Computing all small cuts in undirected networks, in: Ding-Zhu Du, Xiang-Sun Zhang (Eds.), Lectures Notes in Computer Science, vol. 834, Springer, Berlin, Algorithms and Computation, ISAAC’94, 1994, pp. 190–198.
4. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
5. Pulleyblank, Presentation at SIAM Meeting on Optimization, MIT, Boston, 1982.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献