18 search results - page 2 / 4 » ciac 2006 |
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...