Bounds and algorithms for geodetic hulls

DOI10.1007/978-3-030-95018-7_15OpenAlexW4206987835MaRDI QIDQ6102275

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

hull numbergeodetic iteration numbergraph contour

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• On the geodetic iteration number of the contour of a graph
• The complexity ecology of parameters: An illustration using bounded max leaf number
• An 0(n log n) algorithm for the convex bipartite matching problem
• The hull number of a graph
• Rubber bands, convex embeddings and graph connectivity
• Convexity in graphs
• The P3 infection time is W[1-hard parameterized by the treewidth]
• On the hull number of some graph classes
• The geodesic classification problem on graphs
• Geodesic Convexity in Graphs
• Geodetic Sets in Graphs
• Constructing the convex hull of a set of points in the plane
• Searching for geodetic boundary vertex sets
• Convexity in Graphs and Hypergraphs
• The Geodetic Hull Number is Hard for Chordal Graphs

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