Pages that link to "Item:Q1900143"
From MaRDI portal
The following pages link to Graph partitioning applied to the logic testing of combinational circuits (Q1900143):
Displaying 6 items.
- Partitioning circuits for improved testability (Q920939) (← links)
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115) (← links)
- Effects of adding a reverse edge across a stem in a directed acyclic graph (Q1737833) (← links)
- PO-MOESP subspace identification of directed acyclic graphs with unknown topology (Q2409410) (← links)
- Study on the automatic partitioning of logic schematics (Q2720097) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)