On pitfalls in computing the geodetic number of a graph

DOI10.1007/S11590-006-0032-3MaRDI QIDQ2463833zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Nikolaj van Omme

Publication date 6 December 2007

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-006-0032-3

zbMATH Keywords

algorithmgeodetic numbergraphmaximal geodetic closure

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1933222
• Some remarks on the geodetic number of a graph
• scientific article; zbMATH DE number 1156614
• Hardness and approximation for the geodetic set problem in some graph classes
• The closed geodetic numbers of graphs

Cites work

• Computational Complexity of Geodetic Set
• Geodesics in graphs, an extremal set problem, and perfect hash families
• Geodetic spectra of graphs.
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• On The Edge Geodetic Number Of A Graph
• On the geodetic number of a graph
• On the Steiner, geodetic and hull numbers of graphs
• The geodetic number of a graph
• The geodetic number of an oriented graph

Cited in

(7)

• On the hardness of finding the geodetic number of a subcubic graph
• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
• Algorithmic upper bounds for graph geodetic number
• Strong geodetic problem in networks
• Strong geodetic cores and Cartesian product graphs
• scientific article; zbMATH DE number 1933222 (Why is no real title available?)
• Strong geodetic problem on complete multipartite graphs

This page was built for publication: On pitfalls in computing the geodetic number of a graph

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