Add to ORKGAs graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge inser-tion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams. In this paper, we introduce a new approach to handling graph streams, by instead seeking solutions for the parameterized versions of these problems where we are given a parameter k and the objective is to decide whether there is a solution bounded by k. By combining kernelization techniques with randomized sketch structures, we obtain the first streaming algorithms for the parameterized versions of the Vertex Cover...
Streaming algorithms, which process very large datasets received one update at a time, are a key too...
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a v...
We present a streaming algorithm that makes one pass over the edges of an unweighted graph pre-sente...
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The mode...
Streaming is a model where an input graph is provided one edge at a time, instead of being able to i...
Streaming is a model where an input graph is provided one edge at a time, instead of being able to i...
Over the last few years, there has been considerable amount of study and work on developing algorith...
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a v...
We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the st...
Parameterized complexity attempts to give a more fine-grained analysis of the complexity of problems...
This paper studies the set cover problem under the semi-streaming model. The underlying set system i...
Massive graphs arise in a many scenarios, for example, traffic data analysis in large networks, larg...
Massive graphs arise in a many scenarios, for example, traffic data analysis in large networks, larg...
With recent advances in storage technology, it is now possible to store the vast amounts of data gen...
Abstract. We examine the behavior of two kernelization techniques for the vertex cover problem viewe...
Streaming algorithms, which process very large datasets received one update at a time, are a key too...
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a v...
We present a streaming algorithm that makes one pass over the edges of an unweighted graph pre-sente...
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The mode...
Streaming is a model where an input graph is provided one edge at a time, instead of being able to i...
Streaming is a model where an input graph is provided one edge at a time, instead of being able to i...
Over the last few years, there has been considerable amount of study and work on developing algorith...
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a v...
We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the st...
Parameterized complexity attempts to give a more fine-grained analysis of the complexity of problems...
This paper studies the set cover problem under the semi-streaming model. The underlying set system i...
Massive graphs arise in a many scenarios, for example, traffic data analysis in large networks, larg...
Massive graphs arise in a many scenarios, for example, traffic data analysis in large networks, larg...
With recent advances in storage technology, it is now possible to store the vast amounts of data gen...
Abstract. We examine the behavior of two kernelization techniques for the vertex cover problem viewe...
Streaming algorithms, which process very large datasets received one update at a time, are a key too...
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a v...
We present a streaming algorithm that makes one pass over the edges of an unweighted graph pre-sente...