Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference16 articles.
1. Bray, N., Weisstein, E.W.: Graph Product. Math World - A Wolfram Web Resource. http://mathworld.wolfram.com/GraphProduct.html
2. Bruno, A., Yasaki, D.: The arithmetic of trees. Involve 4(1), 1–11 (2011)
3. Feigenbaum, J., Hershberger, J., Schäfter, A.A.: A polynomial time algorithm for finding the prime factors of Cartesian-product graphs. Discret. Appl. Math. 12, 123–138 (1985)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability, Appendix A7.2. Freeman & Co., San Francisco (1979)
5. Hivert, F., Novelli, J.-C., Thibon, J.-Y.: The algebra of binary search trees. Theor. Comput. Sci. 339, 129–165 (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Submodular Functions and Rooted Trees;Theory of Computing Systems;2022-07-29