Author:
Boros Endre,Borys Konrad,Elbassioni Khaled,Gurvich Vladimir,Makino Kazuhisa,Rudolf Gabor
Publisher
Springer Berlin Heidelberg
Reference14 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. Berge, C.: Hypergraphs. Elsevier-North Holland, Amsterdam (1989)
3. Lecture Notes in Computer Science;E. Boros,2004
4. Cheriyan, J., Kao, M.-Y., Thurimella, R.: Algorithms for parallel k-vertex connectivity and sparse certificates. 22, 157–174 (1993)
5. Coulbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献