A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
scientific article

    Statements

    A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (English)
    0 references
    1 December 1994
    0 references
    VLSI design
    0 references
    logical test
    0 references
    circuit partitioning
    0 references
    graph partitioning
    0 references
    integrated VLSI circuits
    0 references
    tabu search
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references