Bounds and algorithms for geodetic hulls

DOI10.1007/978-3-030-95018-7_15MaRDI QIDQ6102275zbMATH OpenOpenAlexFDO

Authors Sabine Storandt

Publication date 8 May 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-95018-7_15

zbMATH Keywords

geodetic iteration numbergraph contourhull number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• An 0(n log n) algorithm for the convex bipartite matching problem
• Constructing the convex hull of a set of points in the plane
• Convexity in graphs
• Convexity in Graphs and Hypergraphs
• Geodesic Convexity in Graphs
• Geodetic sets in graphs
• scientific article; zbMATH DE number 5506229 (Why is no real title available?)
• On the geodetic iteration number of the contour of a graph
• On the hull number of some graph classes
• Rubber bands, convex embeddings and graph connectivity
• Searching for geodetic boundary vertex sets
• The complexity ecology of parameters: An illustration using bounded max leaf number
• The geodesic classification problem on graphs
• The geodetic hull number is hard for chordal graphs
• The hull number of a graph
• The P3 infection time is W[1]-hard parameterized by the treewidth

Cited in

(7)

• Block decomposition approach to compute a minimum geodetic set
• Near-linear-time algorithm for the geodetic Radon number of grids
• BOX-COUNTING DIMENSION RELATED TO THE BOUNDARY OF HEXAGONAL ARRAYS FOR AN EFFICIENT DIGITAL EARTH MODEL
• Algorithms and complexity for geodetic sets on partial grids
• Improved bounds for geodetic hulls
• Geodesic structures in Chebyshev and Manhattan metric spaces
• On geodetic sets formed by boundary vertices

This page was built for publication: Bounds and algorithms for geodetic hulls

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