Algorithmic upper bounds for graph geodetic number

DOI10.1007/s10100-021-00760-7OpenAlexW3178412543MaRDI QIDQ2103929

Ahmad T. Anaqreh, Tamás Vinkó, Boglárka G.-Tóth

Publication date: 9 December 2022

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.10989

zbMATH Keywords

upper boundinteger linear programminggeodetic numbergreedy heuristic

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• On the geodetic number and related metric sets in Cartesian product graphs
• The geodetic number of a graph
• Products of geodesic graphs and the geodetic number of products
• Strong geodetic problem in networks
• The lower and upper forcing geodetic numbers of block--cactus graphs
• On pitfalls in computing the geodetic number of a graph
• On the geodetic number of a graph
• Statistical mechanics of complex networks
• Computational Complexity of Geodetic Set
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Algorithmic upper bounds for graph geodetic number