An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246)
From MaRDI portal
!
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 7495524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs |
scientific article; zbMATH DE number 7495524 |
Statements
An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (English)
0 references
22 March 2022
0 references
outerplanar graph
0 references
strong geodetic set
0 references
strong geodetic number
0 references
geodetic set
0 references
geodetic number
0 references
geodesic convexity
0 references
0 references
0.9142053
0 references
0.8910984
0 references
0.8910932
0 references
0.8765785
0 references
0.87625694
0 references
0.8761011
0 references
0.8724932
0 references
0.87226295
0 references
