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
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)
Recommendations
- Rapid and accurate computation of the distance function using grids 👍 👎
- On the geodetic Radon number of grids 👍 👎
- An Algorithm for Non-Matching Grid Projections with Linear Complexity 👍 👎
- A Fast Discrete Approximation Algorithm for the Radon Transform 👍 👎
- Algorithms and complexity for geodetic sets on partial grids 👍 👎
- Bounds and algorithms for geodetic hulls 👍 👎
- On fast integration in geoid determination 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
