@article{dmtcs:2779,
    title      = {The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees},
    author     = {Götz Olaf Munsonius},
    url        = {https://dmtcs.episciences.org/2779},
    doi        = {10.46298/dmtcs.2779},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
    issuetitle = {Proceedings},
    eid        = 1,
    year       = {2010},
    month      = {Jan},
    keywords   = {internal path length, Wiener index, total Steiner $k$-distance, recursive trees, contraction method, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]},
    language   = {English},
}