Pages that link to "Item:Q1315459"
From MaRDI portal
The following pages link to A tight upper bound for group testing in graphs (Q1315459):
Displaying 11 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)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- A group testing problem for graphs with several defective edges (Q1348382) (← links)
- A parallel algorithm for nearly optimal edge search (Q1350305) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- Group testing in graphs (Q2471072) (← links)
- A competitive algorithm to find all defective edges in a graph (Q2486071) (← links)
- A Combinatorial Model of Two-Sided Search (Q5895055) (← links)
