Sciweavers

525 search results - page 19 / 105
» Bidimensionality and geometric graphs
Sort
View
COMBINATORICA
2011
12 years 7 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
CCCG
2010
13 years 9 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
JCT
2007
103views more  JCT 2007»
13 years 7 months ago
Geometric drawings of Kn with few crossings
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
Bernardo M. Ábrego, Silvia Fernández...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 7 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
ICDM
2008
IEEE
127views Data Mining» more  ICDM 2008»
14 years 2 months ago
Frequent Subgraph Retrieval in Geometric Graph Databases
Sebastian Nowozin, Koji Tsuda