Algorithmic upper bounds for graph geodetic number
type: Item
instance of: scholarly article
title: Algorithmic upper bounds for graph geodetic number
author: Ahmad T. Anaqreh
author: Tamás Vinkó
author: Boglárka G.-Tóth
published in: CEJOR. Central European Journal of Operations Research
publication date: 2022-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2011.10989
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7630652
zbMATH Keywords: geodetic number
zbMATH Keywords: integer linear programming
zbMATH Keywords: upper bound
zbMATH Keywords: greedy heuristic
describes a project that uses: AMPL
MaRDI profile type: Publication
OpenAlex ID: W3178412543
cites work: On the forcing connected geodetic number and the connected geodetic number of a graph.
cites work: Statistical mechanics of complex networks
cites work: Computational Complexity of Geodetic Set
cites work: On the geodetic number and related metric sets in Cartesian product graphs
cites work: On the geodetic number of a graph
cites work: Q3267900
cites work: On pitfalls in computing the geodetic number of a graph
cites work: The geodetic number of a graph
cites work: Strong geodetic problem in networks
cites work: Products of geodesic graphs and the geodetic number of products
cites work: The lower and upper forcing geodetic numbers of block--cactus graphs
cites work: Collective dynamics of ‘small-world’ networks
DOI: 10.1007/S10100-021-00760-7
description: scientific article; zbMATH DE number 7630652