3471 search results - page 410 / 695 » Obstacle Numbers of Graphs |
185
click to vote
DM
2002
15 years 6 months ago
2002
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...
178
click to vote
IJCM
2002
15 years 6 months ago
2002
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...
184
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
188
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
188
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
The non-local means filter is one of powerful denoising methods which allows participation of far, but proper pixels in the denoising process. Although the weights of non-similar ...