Global wire routing in two-dimensional arrays (Q1097238): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Integer-making'' theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional stochastic model for interconnections in master slice integrated circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for circuit routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing gulde / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global wire routing in two-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank

Latest revision as of 13:24, 18 June 2024

scientific article
Language Label Description Also known as
English
Global wire routing in two-dimensional arrays
scientific article

    Statements

    Global wire routing in two-dimensional arrays (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    global routing
    0 references
    gate arrays
    0 references
    integer programming
    0 references
    linear programming
    0 references
    computer-aided design for integrated circuits
    0 references
    routing wires of a VLSI chip
    0 references
    regular rectangular array
    0 references

    Identifiers