Finding minimum congestion spanning trees (Q5463408): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 22:28, 5 March 2024

scientific article; zbMATH DE number 2192042
Language Label Description Also known as
English
Finding minimum congestion spanning trees
scientific article; zbMATH DE number 2192042

    Statements

    Finding minimum congestion spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2005
    0 references
    0 references
    polynomial time algorithm
    0 references