Publisher
Springer International Publishing
Reference15 articles.
1. Cayley, A.: A theorem on trees. Quart. J. Pure Appl. Math. 23, 376–378 (1889)
2. Chen, W.K.: Graph Theory and Its Engineering Applications. World Scientific, Singapore (1997)
3. Fomin, S., Grigoriev, D., Koshevoy, G.: Subtraction-free complexity, cluster transformations, and spanning trees. Found. Comput. Math. 15, 1–31 (2016)
4. Hrubeš, P., Yehudayoff, A.: Shadows of Newton polytopes. In: 36th Computational Complexity Conference (CCC 2021), Leibniz International Proceeding in Informatics, vol. 200, pp. 9:1–9:23 (2021)
5. Jukna, S., Seiwert, H.: Sorting can exponentially speed up pure dynamic programming. Inf. Processing Letters 159–160, 105962 (2020)