S. A. Lozhkin, Di Mo. Some Near-Optimal Embeddings of Full Binary and Ternary Trees in Rectangular Lattices of Minimal Length. // Moscow University Computational Mathematics and Cybernetics. – 2025. – DOI: 10.3103/s0278641925700049. – URL: https://doi.org/10.3103/s0278641925700049
S. A. Lozhkin & Di Mo (2025). Some Near-Optimal Embeddings of Full Binary and Ternary Trees in Rectangular Lattices of Minimal Length. Moscow University Computational Mathematics and Cybernetics. https://doi.org/10.3103/s0278641925700049
S. A. Lozhkin and Di Mo. “Some Near-Optimal Embeddings of Full Binary and Ternary Trees in Rectangular Lattices of Minimal Length.” Moscow University Computational Mathematics and Cybernetics, 2025. doi:10.3103/s0278641925700049.
@article{Lozhkin2025,
title = {Some Near-Optimal Embeddings of Full Binary and Ternary Trees in Rectangular Lattices of Minimal Length},
author = {Lozhkin, S. A. and Mo, Di},
journal = {Moscow University Computational Mathematics and Cybernetics},
year = {2025},
doi = {10.3103/s0278641925700049},
url = {https://doi.org/10.3103/s0278641925700049}
}