Algorithms for routing in planar graphs (Q1075054): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Disjoint paths in a rectilinear grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Three-Layer Channel Routing / rank
 
Normal rank

Latest revision as of 13:52, 17 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for routing in planar graphs
scientific article

    Statements

    Algorithms for routing in planar graphs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    pairwise edge-disjoint paths
    0 references