Author:
Chakraborty Maumita,Mehera Ranjan,Pal Rajat Kumar
Reference22 articles.
1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Divide-and-Conquer: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge, Massachusetts (2009)
2. Berger, I.: The Enumeration of Trees without Duplication. IEEE Trans. Circuit Theor. 14(4), 417–418 (1967)
3. Char, J.P.: Generation of trees, two-trees, and storage of master forests. IEEE Trans. Circuit Theor. 15(3), 228–238 (1968)
4. Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM J. Comput. 7(3), 280–287 (1978)
5. McElroy, M.D.: Algorithm 354: generator of spanning trees [H]. Commun. ACM 12(9), 511 (1969)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献