Author:
Bérczi Kristóf,Végh László A.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Bérczi, K., Kobayashi, Y.: An Algorithm for (n − 3)–Connectivity Augmentation Problem: Jump System Approach. Technical report, Department of Mathematical Engineering, University of Tokyo, METR 2009-12
2. Cornuéjols, G., Pulleyblank, W.: A Matching Problem With Side Conditions. Discrete Math. 29, 135–139 (1980)
3. Frank, A.: Restricted t-matchings in Bipartite Graphs. Discrete Appl. Math. 131, 337–346 (2003)
4. Frank, A., Jordán, T.: Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory Ser. B 65, 73–110 (1995)
5. Gabow, H.N.: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. In: STOC ’83: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 448–456. ACM, New York (1983)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献