Title of article
Polynomial time algorithm for the Radon number of grids in the geodetic convexity
Author/Authors
Dourado، نويسنده , , Mitre Costa and Rautenbach، نويسنده , , Dieter and Pereira de Sل، نويسنده , , Vinيcius Gusmمo and Szwarcfiter، نويسنده , , Jayme Luiz Szwarcfiter، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
6
From page
371
To page
376
Abstract
The Radon number of a graph is the minimum integer r such that all sets of at least r vertices of the graph can be partitioned into two subsets whose convex hulls intersect. We present a near-linear O ( d log d ) time algorithm to calculate the Radon number of d-dimensional grids in the geodetic convexity. To date, no polynomial time algorithm was known for this problem.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2013
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456495
Link To Document