Near-linear-time algorithm for the geodetic Radon number of grids
DOI10.1016/J.DAM.2015.05.001zbMATH Open1339.05304OpenAlexW878485190MaRDI QIDQ299103FDOQ299103
Mitre C. Dourado, Dieter Rautenbach, Jayme L. Szwarcfiter, V. G. Pereira de Sá
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
Recommendations
- On the geodetic Radon number of grids
- Algorithms and complexity for geodetic sets on partial grids
- scientific article; zbMATH DE number 1986052
- Bounds and algorithms for geodetic hulls
- An algorithm for non-matching grid projections with linear complexity
- Rapid and accurate computation of the distance function using grids
- On fast integration in geoid determination
- scientific article; zbMATH DE number 4009685
- A Fast Discrete Approximation Algorithm for the Radon Transform
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Geodesic Convexity in Graphs
- Partition numbers for trees and ordered sets
- On the geodetic Radon number of grids
- Der Satz von Radon in konvexen Produktstrukturen. II
- Aspects of convexity and its applications
- Convexity and graph theory. Proceedings of the Conference on Convexity and Graph Theory, Israel, March 1981
Cited In (5)
This page was built for publication: Near-linear-time algorithm for the geodetic Radon number of grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299103)
