Publisher
Springer Berlin Heidelberg
Reference79 articles.
1. Abu-Sbeih, M.Z.: On the number of spanning trees of K n and K m,n . Discrete Math. 84, 205–207 (1990)
2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison Wesley, Reading (1983)
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
4. Anderson, S.S., Harary, F.: Trees and unicyclic graphs. Math. Teach. 60, 345–348 (1967)
5. Arora, S., Karakostas, G.: A 2+ε approximation algorithm for the k-MST problem. Math. Program. 107, 491–504 (2006)