Pages that link to "Item:Q1195870"
From MaRDI portal
The following pages link to Minimal cut cover of a graph with an application to the testing of electronic boards (Q1195870):
Displaying 9 items.
- Edge cover by connected bipartite subgraphs (Q646717) (← links)
- A note on the minimum cut cover of graphs (Q1342081) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- On fractional cut covers (Q2312658) (← links)
- Identifying defective network components through restricted group testing (Q2329566) (← links)
- The minimum cut cover problem (Q2840718) (← links)
- (Q3347625) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)