Author:
Khachiyan L.,Boros E.,Borys K.,Elbassioni K.,Gurvich V.,Makino K.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Tamura, A., Shioura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM Journal on Computing 26(3), 678–692 (1997)
2. Bang-Jensen, J., Gabow, H.N., Jordán, T., Szigeti, Z.: Edge-connectivity augmentation with partition constraints. SIAM Journal on Discrete Mathematics 12(2), 160–207 (1999)
3. Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131, 255–281 (2003)
4. Lecture Notes in Computer Science;E. Boros,2004
5. Coulbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献