45 search results - page 3 / 9 » cats 2008 |
CATS
2008
13 years 6 months ago
2008
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
CATS
2008
13 years 6 months ago
2008
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
CANDC
2008
ACM
13 years 5 months ago
2008
ACM
CATS
2008
13 years 6 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
CATS
2008
13 years 6 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...