A competitive algorithm in searching for many edges in a hypergraph (Q869578): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.07.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965118588 / rank | |||
Normal rank | |||
Revision as of 00:07, 20 March 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
