Balancing minimum spanning trees and shortest-path trees (Q1899219)

From MaRDI portal
Revision as of 09:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Balancing minimum spanning trees and shortest-path trees
scientific article

    Statements

    title
    Balancing minimum spanning trees and shortest-path trees (English)
    0 references
    author
    Samir Khuller
    0 references
    Balaji Raghavachari
    0 references
    Neal E. Young
    0 references
    published in
    Algorithmica
    0 references
    publication date
    11 March 1996
    0 references
    zbMATH Keywords
    spanning tree
    0 references
    shortest-path
    0 references

    Identifiers

    DOI
    10.1007/BF01294129
    0 references
    zbMATH DE Number
    803317
    0 references
    OpenAlex ID
    W2951475756
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1899219&oldid=37100946"
    Powered by MediaWiki