1933 search results - page 94 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
134
Voted
ANOR
2005
15 years 3 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
143
Voted
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
147
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
147
Voted
LREC
2008
15 years 5 months ago
2008
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
118
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivit...