Pages that link to "Item:Q1176719"
From MaRDI portal
The following pages link to A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719):
Displaying 17 items.
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- Search problems on graphs (Q1082080) (← links)
- A ternary search problem on graphs (Q1118418) (← 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 parallel algorithm for nearly optimal edge search (Q1350305) (← links)
- A ternary search problem on two disjoint sets (Q1627863) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I (Q2069711) (← links)
- An optimal group testing algorithm on \(k\) disjoint sets (Q2367040) (← links)
- Game with Slow Pursuers on the Edge Graphs of Regular Simplexes (Q5057950) (← links)
- Differential Game with Slow Pursuers on the Edge Graph of a Simplex (Q5072237) (← links)
- A Combinatorial Model of Two-Sided Search (Q5890524) (← links)
- Optimal quantitative group testing on cycles and paths (Q5951973) (← links)
