Complexity of metric dimension on planar graphs (Q314819)
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: Complexity of metric dimension on planar graphs |
scientific article; zbMATH DE number 6628246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of metric dimension on planar graphs |
scientific article; zbMATH DE number 6628246 |
Statements
Complexity of metric dimension on planar graphs (English)
0 references
16 September 2016
0 references
metric dimension
0 references
planar graph
0 references
outerplanar graph
0 references
NP-completeness
0 references
0 references
0 references
0 references
0 references
0.9141379
0 references
0.9104075
0 references
0.90869784
0 references
0.9059916
0 references
0.90469456
0 references
0.9029311
0 references
