A competitive algorithm in searching for many edges in a hypergraph (Q869578): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:27, 30 January 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