151 search results - page 13 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
161
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
158
click to vote
POPL
2012
ACM
13 years 11 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
154
Voted
SIAMJO
2008
15 years 3 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
164
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
135
click to vote
ESCAPE
2007
Springer
15 years 7 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...