2095 search results - page 117 / 419 » Improved pebbling bounds |
101
Voted
ENDM
2006
15 years 1 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
TCBB
2010
14 years 11 months ago
2010
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
123
click to vote
DCG
2011
14 years 8 months ago
2011
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
141
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...