Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components (Q5236166)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7117324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components |
scientific article; zbMATH DE number 7117324 |
Statements
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components (English)
0 references
15 October 2019
0 references
graph algorithm
0 references
complexity
0 references
metric dimension
0 references
resolving set
0 references
biconnected component
0 references
0 references
0.89927524
0 references
0.8913178
0 references
0.89101046
0 references
0.8870387
0 references
0.88410354
0 references
0.88410354
0 references
0.88390625
0 references
0 references
