A revised algorithm for searching for all defective edges in a graph (Q765324)
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 revised algorithm for searching for all defective edges in a graph |
scientific article; zbMATH DE number 6015775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A revised algorithm for searching for all defective edges in a graph |
scientific article; zbMATH DE number 6015775 |
Statements
A revised algorithm for searching for all defective edges in a graph (English)
0 references
19 March 2012
0 references
group testing
0 references
graph testing
0 references
defective edges
0 references
competitive algorithm
0 references
0.876305341720581
0 references
0.8757545351982117
0 references
0.8732230067253113
0 references
0.8159757852554321
0 references
0.8159154653549194
0 references
