1105 search results - page 170 / 221 » Linear choosability of graphs |
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
STOC
1998
ACM
15 years 4 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
MFCS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
103
click to vote
POS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two di...