Sciweavers

7840 search results - page 181 / 1568
» On generalized Ramsey numbers
Sort
View
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
15 years 8 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
15 years 8 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
PODC
2010
ACM
15 years 6 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
DM
2010
120views more  DM 2010»
15 years 6 months ago
Collineations and dualities of partial geometries
In this paper, we first prove some general results on the number of fixed points of collineations of finite partial geometries, and on the number of absolute points of dualities o...
Beukje Temmermans, Joseph A. Thas, Hendrik Van Mal...
DM
2008
55views more  DM 2008»
15 years 6 months ago
Improved pebbling bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
Melody Chan, Anant P. Godbole