3 search results - page 1 / 1 » Interval Tournaments |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...
JGT
2007
13 years 4 months ago
2007
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...