Near-linear-time algorithm for the geodetic Radon number of grids

The Radon number of a graph is the minimum integer r such that all sets of at least r of its vertices can be partitioned into two subsets whose convex hulls intersect. Determining the Radon number of general graphs in the geodetic convexity is NP-hard. In this paper, we show the problem is polynomia...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 210; s. 277 - 283
Hlavní autori: Dourado, Mitre Costa, Pereira de Sá, Vinícius Gusmão, Rautenbach, Dieter, Szwarcfiter, Jayme Luiz
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 10.09.2016
Predmet:
Algorithms
Convexity
Geodetic convexity
Graph convexity
Graph theory
Graphs
Grids
Hulls (structures)
Mathematical analysis
Polynomials
Radon
Radon number
Grids
Graph convexity
Radon number
Geodetic convexity
ISSN:0166-218X, 1872-6771
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The Radon number of a graph is the minimum integer r such that all sets of at least r of its vertices can be partitioned into two subsets whose convex hulls intersect. Determining the Radon number of general graphs in the geodetic convexity is NP-hard. In this paper, we show the problem is polynomial for d-dimensional grids, for all d≥1. The proposed algorithm runs in near-linear O(d(logd)1/2) time for grids of arbitrary sizes, and in sub-linear O(logd) time when all grid dimensions have the same size.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2015.05.001