253 search results - page 43 / 51 » Perfection thickness of graphs |
DAM
2002
13 years 7 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
: Much of the current theory of networked control systems uses simple point-to-point communiodels as an abstraction of the underlying network. As a result, the controller has very ...
116
click to vote
Publication
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is
selected aut...
112
click to vote
Presentation
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...