An NP-completeness result of edge search in graphs (Q2014718): 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.1007/s00373-013-1287-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075281130 / rank | |||
Normal rank | |||
Revision as of 18:08, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An NP-completeness result of edge search in graphs |
scientific article |
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
