Pages that link to "Item:Q3964573"
From MaRDI portal
The following pages link to A Group Testing Problem on Two Disjoint Sets (Q3964573):
Displaying 17 items.
- A revised algorithm for searching for all defective edges in a graph (Q765324) (← links)
- A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
- Search problems on graphs (Q1082080) (← links)
- Determining defectives in a linear order (Q1085612) (← links)
- A ternary search problem on graphs (Q1118418) (← links)
- Group testing with two defectives (Q1164364) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- A binary search problem on graphs (Q1186168) (← links)
- A tight upper bound for group testing in graphs (Q1315459) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- A group testing problem for graphs with several defective edges (Q1348382) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- Quaternary splitting algorithm in group testing (Q2025097) (← links)
- Group testing problem with two defectives (Q2262985) (← links)
- An optimal group testing algorithm on \(k\) disjoint sets (Q2367040) (← links)
- Group testing in graphs (Q2471072) (← links)
- Hypergeometric and Generalized Hypergeometric Group Testing (Q3953054) (← links)
