Algorithmic upper bounds for graph geodetic number (Q2103929)
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 7630652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic upper bounds for graph geodetic number |
scientific article; zbMATH DE number 7630652 |
Statements
Algorithmic upper bounds for graph geodetic number (English)
0 references
9 December 2022
0 references
geodetic number
0 references
integer linear programming
0 references
upper bound
0 references
greedy heuristic
0 references
0.7928569912910461
0 references
0.7858325839042664
0 references
0.768057107925415
0 references
0.7581948041915894
0 references
