Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. J. Cheriyan and S.N. Maheshwari, Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9 (1988) 507–537.
2. J. Edmonds, Submodular functions, matroids and certain polyhedra, in: R. Guy et al. (Eds.) Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1969) 69–87.
3. M.R. Garey and D.S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA 1979.
4. Z. Ge and S.L. Hakimi, Disjoint rooted spanning trees with small depths in de Bruijn and Kautz graphs, SIAM J. Comput. 26 (1997) 79–92.
5. A. Huck, Independent trees in graphs. Graphs and Combin. 10 (1994) 29–45.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献