2310 search results - page 176 / 462 » Coloring Random Graphs |
140
Voted
HT
2010
ACM
15 years 4 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
112
click to vote
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
106
click to vote
COMBINATORICS
2004
15 years 2 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
132
click to vote
DM
1999
15 years 2 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
124
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...