Hardness and approximation for the geodetic set problem in some graph classes (Q779181)
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: Hardness and approximation for the geodetic set problem in some graph classes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and approximation for the geodetic set problem in some graph classes |
scientific article |
Statements
Hardness and approximation for the geodetic set problem in some graph classes (English)
0 references
21 July 2020
0 references
0.8583537340164185
0 references
0.8529465198516846
0 references
0.8469206690788269
0 references
0.8358772993087769
0 references
0.8136680722236633
0 references
