Sciweavers

3268 search results - page 375 / 654
» The hub number of a graph
Sort
View
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
IJCM
2002
83views more  IJCM 2002»
15 years 6 months ago
A Radio Coloring of a Hypercube
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Ophir Frieder, Frank Harary, Peng-Jun Wan