2252 search results - page 270 / 451 » Lower Bounds for Dynamic Algorithms |
226
click to vote
PDCAT
2005
Springer
16 years 13 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
195
Voted
WG
2005
Springer
16 years 13 days 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 ...
191
Voted
COMPGEOM
2003
ACM
16 years 6 days ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
179
Voted
SI3D
2003
ACM
16 years 6 days ago
2003
ACM
Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In th...
188
click to vote
GBRPR
2003
Springer
16 years 5 days ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...