Search Results - (semi-)streaming graph algorithms

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring by Assadi, Sepehr, Kumar, Pankaj, Mittal, Parth

“…$-coloring in the semi-streaming model as well? We settle this key question in the affirmative by designing a randomized semi-streaming algorithm that given any graph, with high probability, either correctly declares that the graph is not $\Delta…”
Get full text

Useful Graph Semi-Streaming Expanding the Scope of Dynamic Graph Processing by West, Evan T

“…Systems for graph-processing (computing some property of a graph) are commonly designed for computing on sparse and static graphs…”
Get full text

Semi-Streaming Algorithms for Annotated Graph Streams by Thaler, Justin

“… One of the few bright spots has been the development of semi-streaming algorithms for a handful of graph problems -- these algorithms use space \(O(n\cdot\text{polylog}(n…”
Get full text

Optimal per-edge processing times in the semi-streaming model by Zelke, Mariano

“…We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks…”
Get full text

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for \(\Delta\)-Coloring by Assadi, Sepehr, Kumar, Pankaj, Mittal, Parth

“…\)-coloring in the semi-streaming model as well? We settle this key question in the affirmative by designing a randomized semi-streaming algorithm that given any graph, with high probability, either correctly declares that the graph is not \(\Delta…”
Get full text

CA-GNN: A Competence-Aware Graph Neural Network for Semi-Supervised Learning on Streaming Data by Yu, Hang, Wen, Jiahao, Sun, Yiping, Wei, Xiao, Lu, Jie

“…) algorithms becoming an efficient tool for streaming data mining. Recently, the graph-based SSL algorithms have been proposed to improve SSL performance because the graph structure can utilize the interactivity between surrounding nodes…”
Get full text

On graph problems in a semi-streaming model by Feigenbaum, Joan, Kannan, Sampath, McGregor, Andrew, Suri, Siddharth, Zhang, Jian

“…We formalize a potentially rich new streaming model, the semi-streaming model, that we believe is necessary for the fruitful study of efficient algorithms for solving problems on massive graphs whose…”
Get full text

Weighted Matching in the Semi-Streaming Model by Zelke, Mariano

“…We present an approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model…”
Get full text

Bipartite Matching in the Semi-streaming Model by Eggert, Sebastian, Kliemann, Lasse, Munstermann, Peter, Srivastav, Anand

“…We present the first deterministic 1+ ε approximation algorithm for finding a large matching in a bipartite graph in the semi-streaming model which requires only O ((1/ ε ) 5…”
Get full text

Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model by Feldman, Moran, Szarf, Ariel

“…, the state-of-the-art single-pass semi-streaming algorithm for it is still a simple greedy algorithm…”
Get full text

Meta-theorems for Parameterized Streaming Algorithms by Lokshtanov, Daniel, Misra, Pranabendu, Panolan, Fahad, Ramanujan, M S, Saket Saurabh, Zehavi, Meirav

“… Thus, we explore {\em semi-streaming} algorithms for parameterized graph problems, and present the first systematic…”
Get full text

Deterministic Graph Coloring in the Streaming Model by Assadi, Sepehr, Chen, Andrew, Sun, Glenn

“…Recent breakthroughs in graph streaming have led to the design of single-pass semi-streaming algorithms for various graph coloring problems such as \((\Delta+1…”
Get full text

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching by Assadi, Sepehr

“…We present a simple semi-streaming algorithm for $(1-ε)$-approximation of bipartite matching in $O(\log{\!(n)}/ε)$ passes…”
Get full text

Engineering Semi-streaming DFS algorithms by Kancharla Nikhilesh Bhagavan, Macharla Sri Vardhan, Madamanchi, Ashok Chowdary, Khan, Shahbaz

“…)\). In the streaming environment, most graph problems are studied in the semi-streaming model where several passes (preferably one…”
Get full text

Improved Bounds for Matching in Random-Order Streams by Bernstein, Aaron

“… In the semi-streaming model, the edges of the input graph G = ( V , E ) are given as a stream e 1…”
Get full text

Analyzing massive graphs in the semi-streaming model by Ahn, Kook Jin

“… The semi-streaming model was proposed for processing massive graphs. In the semi-streaming model, we have a random accessible memory which is near-linear in the number of vertices. The input graph…”
Get full text

Spectral Sparsification in the Semi-streaming Setting by Kelner, Jonathan A., Levin, Alex

“… This notion is strictly stronger than the earlier concept of combinatorial sparsification. In this paper, we consider a semi-streaming setting, where we have only storage space, and we thus cannot keep all of G…”
Get full text

k-Connectivity in the Semi-Streaming Model by Zelke, Mariano

“…We present the first semi-streaming algorithms to determine k-connectivity of an undirected graph with k being any constant…”
Get full text

On Adaptivity and Randomness for Streaming Algorithms by Stoeckl, Manuel

“…A streaming algorithm has a limited amount of memory and reads a long sequence (data stream) of input elements, one by one, and computes an output depending on the input…”
Get full text

(\mathcal{O}(\log\log{n})\) Passes is Optimal for Semi-Streaming Maximal Independent Set by Assadi, Sepehr, Konrad, Christian, Naidu, Kheeran K, Sundaresan, Janani

“…In the semi-streaming model for processing massive graphs, an algorithm makes multiple passes over the edges of a given \(n…”
Get full text