An NP-completeness result of edge search in graphs (Q2014718): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00373-013-1287-y / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q3861131 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4857782 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5395177 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching for an edge in a graph with restricted test sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge search in graphs with restricted test sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4855976 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4217266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A probabilistic upper bound for the edge identification complexity of graphs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00373-013-1287-Y / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:43, 16 December 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
0 references