181
click to vote
SWAT
15 years 11 months ago
2004 Springer 
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
170
click to vote
SWAT
15 years 11 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...
167
click to vote
SWAT
15 years 11 months ago
2004 Springer 
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
164
click to vote
SWAT
15 years 11 months ago
2004 Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
153
Voted
SWAT
15 years 11 months ago
2004 Springer 
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
|
Algorithms