Algorithmic upper bounds for graph geodetic number

DOI10.1007/S10100-021-00760-7OpenAlexW3178412543MaRDI QIDQ2103929FDOQ2103929

Authors: 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

Recommendations

• Some remarks on the geodetic number of a graph
• On pitfalls in computing the geodetic number of a graph
• scientific article; zbMATH DE number 1156614
• On The Edge Geodetic Number Of A Graph
• Hardness and approximation for the geodetic set problem in some graph classes

zbMATH Keywords

integer linear programmingupper boundgreedy heuristicgeodetic number

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Statistical mechanics of complex networks
• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• On the geodetic number of a graph
• The geodetic number of a graph
• On the geodetic number and related metric sets in Cartesian product graphs
• Products of geodesic graphs and the geodetic number of products
• Computational Complexity of Geodetic Set
• On the forcing connected geodetic number and the connected geodetic number of a graph.
• Strong geodetic problem in networks
• On pitfalls in computing the geodetic number of a graph
• The lower and upper forcing geodetic numbers of block--cactus graphs

Cited In (3)

• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• AMPL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103929)