An algorithm for tree-realizability of distance matrices<sup>∗</sup> (Q3477951)

From MaRDI portal
Revision as of 21:34, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An algorithm for tree-realizability of distance matrices<sup>∗</sup>
scientific article

    Statements

    title
    An algorithm for tree-realizability of distance matrices<sup>∗</sup> (English)
    0 references
    author
    Vladimir Batagelj
    0 references
    Tomaž Pisanski
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    tree realizability
    0 references
    distance matrices
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68P05
    0 references
    68R10
    0 references
    zbMATH DE Number
    4147503
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3477951&oldid=16813102"
    Powered by MediaWiki