Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3 ? connected graphs. J. Algorithms9, 507?537 (1988)
2. Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Combinatorial Structures and Their Applications, R. Guy et al, Eds. Gordon and Breach, New York, 1969, pp. 69?87
3. Hopcroft, J., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comp.2, 135?158 (1973)
4. Itai, A., Rodeh, R.: The multi-tree approach to reliability in distributed networks. Proceedings 25th Annual IEEE Symposium on Foundations of Computer Sciences, 1984, pp. 137?147
5. Khuller, S., Schieber, B.: On independent spanning trees. Inform. Process. Lett.42, (6), 321?323 (1992)
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献