An efficient parallel logarithmic time algorithm for the channel routing problem (Q1201820): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel Algorithms for Channel Routing in the Knock-Knee Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Trees and Parallel Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a rectilinear grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to parallelism in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Three-Layer Channel Routing / rank
 
Normal rank

Latest revision as of 13:12, 17 May 2024

scientific article
Language Label Description Also known as
English
An efficient parallel logarithmic time algorithm for the channel routing problem
scientific article

    Statements

    An efficient parallel logarithmic time algorithm for the channel routing problem (English)
    0 references
    0 references
    17 January 1993
    0 references
    two-terminal net channel routing
    0 references
    knock-knee mode
    0 references
    parallel algorithms
    0 references

    Identifiers