Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
Crossref DOI link: https://doi.org/10.1007/s10878-015-9970-y
Published Online: 2015-11-16
Published Print: 2017-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Salmerón, J. M. G.
Aparicio, G.
Casado, L. G.
García, I.
Hendrix, E. M. T.
G.-Tóth, B.
License valid from 2015-11-16