1576 search results - page 2 / 316 » Streaming Algorithms for Independent Sets |
100
click to vote
ICDE
2012
IEEE
13 years 4 days ago
2012
IEEE
—A facility for merging equivalent data streams can support multiple capabilities in a data stream management system (DSMS), such as query-plan switching and high availability. O...
54
Voted
WADS
2001
Springer
15 years 2 months ago
2001
Springer
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
WEA
2005
Springer
15 years 3 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...