2430 search results - page 17 / 486 » Computing Tutte Polynomials |
155
click to vote
DM
2006
15 years 5 months ago
2006
The recursive computation of the interlace polynomial introduced by Arratia, Bollob
171
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
165
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
152
click to vote
BILDMED
2008
15 years 7 months ago
2008
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
162
click to vote
ICRA
2008
IEEE
16 years 8 days ago
2008
IEEE
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...