A competitive algorithm to find all defective edges in a graph (Q2486071)
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 to find all defective edges in a graph |
scientific article; zbMATH DE number 2192804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A competitive algorithm to find all defective edges in a graph |
scientific article; zbMATH DE number 2192804 |
Statements
A competitive algorithm to find all defective edges in a graph (English)
0 references
5 August 2005
0 references
Group testing
0 references
Graph testing
0 references
Competitive algorithm
0 references
0.8953179121017456
0 references
0.8929734826087952
0 references
0.8732230067253113
0 references
0.859467625617981
0 references
0.8164247274398804
0 references
