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 20 items.
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- 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)
- A ternary search problem on graphs (Q1118418) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← 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)
- Group testing in bipartite graphs (Q1607719) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (Q2369987) (← links)
- Non-adaptive group testing on graphs with connectivity (Q2424809) (← links)
- Group testing in graphs (Q2471072) (← links)
- A competitive algorithm to find all defective edges in a graph (Q2486071) (← links)
- Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms (Q5088467) (← links)
- (Q5090430) (← links)
- A Combinatorial Model of Two-Sided Search (Q5895055) (← links)
- Optimal quantitative group testing on cycles and paths (Q5951973) (← links)
