A competitive algorithm in searching for many edges in a hypergraph (Q869578)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A competitive algorithm in searching for many edges in a hypergraph |
scientific article; zbMATH DE number 5131583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A competitive algorithm in searching for many edges in a hypergraph |
scientific article; zbMATH DE number 5131583 |
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
0.859467625617981
0 references
0.8159757852554321
0 references
0.7817168831825256
0 references
0.781304121017456
0 references
0.7467227578163147
0 references
