3211 search results - page 300 / 643 » On the Grundy Number of a Graph |
144
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
162
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
173
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
108
click to vote
IPL
2006
15 years 6 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
161
click to vote
TIT
2008
15 years 6 months ago
2008
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...