Author:
Bernáth Attila,Király Tamás
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. J. Bang-Jensen, A. Frank and Bill Jackson: Preserving and increasing local edge-connectivity in mixed graphs, SIAM J. Discrete Math. 8 (1995), 155–178.
2. A. A. Benczúr and A. Frank: Covering symmetric supermodular functions by graphs, Math. Program. 84 Ser. B, (1999), 483–503, Connectivity augmentation of networks: structures and algorithms (Budapest, 1994).
3. A. Bernáth and T. Király: A new approach to splitting-off, Tech. Report TR-2008-02, Egerváry Research Group, Budapest, 2008, www.cs.elte.hu/egres .
4. Y. H. Chan, W. S. Fung, L. C. Lau and C. K. Yung: Degree bounded network design with metric costs, Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science (Washington, DC, USA), IEEE Computer Society, 2008, 125–134.
5. B. Cosh: Vertex splitting and connectivity augmentation in hypergraphs, PhDThesis, University of London, (2000).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献