Near-linear-time algorithm for the geodetic Radon number of grids
From MaRDI portal
Publication:299103
DOI10.1016/j.dam.2015.05.001zbMath1339.05304OpenAlexW878485190MaRDI QIDQ299103
Mitre C. Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.001
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (4)
On the \(P_3\)-hull number of some products of graphs ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ On the monophonic rank of a graph ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs
Cites Work
- Aspects of convexity and its applications
- Convexity and graph theory. Proceedings of the Conference on Convexity and Graph Theory, Israel, March 1981
- Partition numbers for trees and ordered sets
- On the geodetic Radon number of grids
- Der Satz von Radon in konvexen Produktstrukturen. II
- Geodesic Convexity in Graphs
This page was built for publication: Near-linear-time algorithm for the geodetic Radon number of grids
