Minimum congestion spanning trees in planar graphs (Q966018): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2009.11.016 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The congestion of \(n\)-cube layout on a rectangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3606127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum congestion spanning trees of grids and discrete toruses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree congestion of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing multi-commodity flow trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree congestion of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal congestion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sobolev spaces on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2009.11.016 / rank
 
Normal rank

Latest revision as of 10:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Minimum congestion spanning trees in planar graphs
scientific article

    Statements

    Minimum congestion spanning trees in planar graphs (English)
    0 references
    27 April 2010
    0 references
    dual graph
    0 references
    minimum congestion spanning tree
    0 references
    planar graph
    0 references
    spanning tree congestion
    0 references

    Identifiers