2252 search results - page 334 / 451 » Lower Bounds for Dynamic Algorithms |
122
click to vote
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
130
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
121
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-Mesh, a network with diameter 4 p N , 3 consisting of N connected meshes of size p N p N...
127
click to vote
GD
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
108
click to vote
AIPS
2004
15 years 4 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...