Complexity results for identifying codes in planar graphs (Q3002553)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for identifying codes in planar graphs |
scientific article |
Statements
Complexity results for identifying codes in planar graphs (English)
0 references
20 May 2011
0 references
graph theory
0 references
identifying codes
0 references
planar graphs
0 references
complexity
0 references
NP-completeness
0 references
NP-hardness
0 references
0 references
