A competitive algorithm in searching for many edges in a hypergraph (Q869578): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2006.07.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2006.07.008 / rank | |||
Normal rank | |||
Latest revision as of 06:17, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A competitive algorithm in searching for many edges in a hypergraph |
scientific article |
Statements
A competitive algorithm in searching for many edges in a hypergraph (English)
0 references
8 March 2007
0 references
competitive algorithm
0 references
hypergraph
0 references
edge-searching problem
0 references
group testing
0 references
graph searching
0 references
