An algorithm for the determination of longest distances in a graph (Q4097107)

From MaRDI portal
Revision as of 19:05, 25 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3516941
Language Label Description Also known as
English
An algorithm for the determination of longest distances in a graph
scientific article; zbMATH DE number 3516941

    Statements

    title
    An algorithm for the determination of longest distances in a graph (English)
    0 references
    DOI
    10.1007/BF01681355
    0 references
    author
    Hartmut Noltemeier
    0 references
    publication date
    1975
    0 references
    zbMATH DE Number
    3516941
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4097107&oldid=8561710"
      Powered by MediaWiki