Sciweavers

3757 search results - page 456 / 752
» The overlap number of a graph
Sort
View
JCT
2007
85views more  JCT 2007»
15 years 6 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
TOG
2008
137views more  TOG 2008»
15 years 6 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
15 years 6 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
EJC
2000
15 years 6 months ago
Further Investigations Involving Rook Polynomials With Only Real Zeros
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
James Haglund
DM
2002
86views more  DM 2002»
15 years 6 months ago
A chip-firing game and Dirichlet eigenvalues
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
Fan R. K. Chung, Robert B. Ellis