An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
From MaRDI portal
Publication:2118246
DOI10.7151/dmgt.2311zbMath1485.05173OpenAlexW3010865183MaRDI QIDQ2118246
Publication date: 22 March 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2311
geodetic numbergeodesic convexityouterplanar graphgeodetic setstrong geodetic numberstrong geodetic set
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- The contour of a bridged graph is geodetic
- On the geodetic iteration number of the contour of a graph
- On the geodeticity of the contour of a graph
- Strong geodetic problem in grid-like architectures
- Some remarks on the geodetic number of a graph
- On the computation of the hull number of a graph
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Characterizations of outerplanar graphs
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Computing simple-path convex hulls in hypergraphs
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- Strong geodetic problem in networks
- Strong geodetic cores and Cartesian product graphs
- Strong edge geodetic problem in networks
- Geodesic Convexity in Graphs
- Block decomposition approach to compute a minimum geodetic set
- Convexity in Graphs and Hypergraphs
- Computational Complexity of Geodetic Set
- Strong geodetic problem on Cartesian products of graphs
This page was built for publication: An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
