Graph partitioning applied to the logic testing of combinational circuits

DOI10.1016/0166-218X(94)00150-CMaRDI QIDQ1900143zbMATH OpenFDO

Authors Madlaine Davis-Moradkhan, Catherine Roucairol

Publication date 17 October 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

VLSI circuit

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Fault detection; testing in circuits and networks (94C12) Applications of graph theory to circuits and networks (94C15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
• On the testability of graph partition properties
• Partitioning circuits for improved testability
• scientific article; zbMATH DE number 975371
• On a graph partition problem with application to VLSI layout
• Partitioning methods for satisfiability testing on large formulas
• Partitioning methods for satisfiability testing on large formulas
• Partitioned probe comparability graphs
• A graph partitioning scheme and applications to fault tolerant computing

Cites work

• scientific article; zbMATH DE number 3898565 (Why is no real title available?)
• scientific article; zbMATH DE number 3972795 (Why is no real title available?)
• scientific article; zbMATH DE number 3709564 (Why is no real title available?)
• scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
• Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing
• LSI logic testing — An overview
• Logic Test Pattern Generation Using Linear Codes
• The Weighted Syndrome Sums Approach to VLSI Testing
• Verification Testing—A Pseudoexhaustive Test Technique

Cited in

(9)

• A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
• Study on the automatic partitioning of logic schematics
• Partitioning \(P_4\)-tidy graphs into a stable set and a forest
• PO-MOESP subspace identification of directed acyclic graphs with unknown topology
• Partitioning circuits for improved testability
• Logic Test Pattern Generation Using Linear Codes
• Application of graph theory to topology generation for logic gates
• scientific article; zbMATH DE number 140133 (Why is no real title available?)
• Effects of adding a reverse edge across a stem in a directed acyclic graph

This page was built for publication: Graph partitioning applied to the logic testing of combinational circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900143)