An NP-completeness result of edge search in graphs (Q2014718)
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: An NP-completeness result of edge search in graphs |
scientific article; zbMATH DE number 6304676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An NP-completeness result of edge search in graphs |
scientific article; zbMATH DE number 6304676 |
Statements
An NP-completeness result of edge search in graphs (English)
0 references
16 June 2014
0 references
group testing problem
0 references
NP-completeness
0 references
combinatorial search
0 references
edge search
0 references
0 references
0 references
0.9015904
0 references
0.8995774
0 references
0 references
0.8943512
0 references
0.89202553
0 references
0 references
0.8834348
0 references
0 references
