The following pages link to Search problems on graphs (Q1082080):
Displayed 18 items.
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Determining defectives in a linear order (Q1085612) (← 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)
- A binary search problem on graphs (Q1186168) (← links)
- An improved algorithm for quantitative group testing (Q1193729) (← links)
- A tight upper bound for group testing in graphs (Q1315459) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- Search problems: One, two or many rounds (Q1344611) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- A ternary search problem on two disjoint sets (Q1627863) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- The optimal procedures for quantitative group testing (Q1825754) (← links)
- An optimal group testing algorithm on \(k\) disjoint sets (Q2367040) (← links)
- Group testing in graphs (Q2471072) (← links)
- A competitive algorithm to find all defective edges in a graph (Q2486071) (← links)
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ (Q5251659) (← links)
- Optimal quantitative group testing on cycles and paths (Q5951973) (← links)