On the computational complexity of the strong geodetic recognition problem (Q6658857)
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 7963433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of the strong geodetic recognition problem |
scientific article; zbMATH DE number 7963433 |
Statements
On the computational complexity of the strong geodetic recognition problem (English)
0 references
8 January 2025
0 references
covering
0 references
NP-completeness
0 references
strong geodetic number
0 references
strong geodetic recognition
0 references
0 references
0 references
0.8462705016136169
0 references
0.8271898031234741
0 references
0.8242368102073669
0 references
0.8135360479354858
0 references
0.8084179162979126
0 references
