A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits |
scientific article; zbMATH DE number 698902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits |
scientific article; zbMATH DE number 698902 |
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
0 references
