Author:
Baiou Mourad,Barahona Francisco
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. M. Baiou, F. Barahona, Packing hypertrees and the k-cut problem in hypergraphs, submitted for publication.
2. Separating from the dominant of the spanning tree polytope;Barahona;Oper. Res. Lett.,1992
3. Network reinforcement;Barahona;Math. Program.,2006
4. Computing minimum cuts in hypergraphs;Chekuri,2017
5. A faster algorithm for computing the strength of a network;Cheng;Inf. Process. Lett.,1994
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献