Suchergebnisse - Graph Streaming Algorithms

Streaming algorithm for graph spanners—single pass and constant processing time per edge von Baswana, Surender

Volltext

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms von Assadi, Sepehr, Raz, Ran

“… We prove that any two-pass graph streaming algorithm for the s-t reachability problem in n -vertex directed graphs requires near-quadratic space of n^{2-o(1)} bits …”
Volltext

TARIS: Scalable Incremental Processing of Time-Respecting Algorithms on Streaming Graphs von Bhoot, Ruchi, Ghanmode, Suved Sanjay, Simmhan, Yogesh

“… There has been little work on supporting time-respecting algorithms at large scales for streaming graphs, which are updated continuously at high rates (Millions …”
Volltext

Spectral Algorithms for Streaming Graph Analysis: A Survey von Sarkar, Braznev, Bhattacharyya, Malay

“… This has motivated the development of streaming algorithms to be applied on graphs at scale. To achieve this scalability, sketching and sampling strategies are generally …”
Volltext

Incremental k-core decomposition: algorithms and evaluation von Sarıyüce, Ahmet Erdem, Gedik, Buğra, Jacques-Silva, Gabriela, Wu, Kun-Lung, Çatalyürek, Ümit V.

“… As a result, it is essential to develop efficient incremental algorithms for dynamic graph data …”
Volltext

AKIN: a streaming graph partitioning algorithm for distributed graph storage systems von Zhang, Wei, Chen, Yong, Dai, Dong

“… While achieving balanced partitions for streaming graphs is easy, existing graph partitioning algorithms either fail to work on streaming workloads, or leave edge-cut ratio to be further improved …”
Volltext

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring von 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 …”
Volltext

Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping von Faraj, Marcelo Fonseca, Schulz, Christian

“… In this work, we present a shared-memory streaming multi-recursive partitioning scheme that performs re-cursive multi-sections on the fly without knowing the overall input graph to compute hierarchical partitionings …”
Volltext

Memgraph Launches Streaming Graph Algorithms

Volltext

Memgraph Introduces Streaming Graph Algorithms

Volltext

Streaming Algorithms and Graph Connectivity von Wang, Zhengyu

“… ) An optimal space lower bound for samplers. Samplers are used as the building blocks for streaming graph algorithms such as graph connectivity …”
Volltext

Deriving Streaming Graph Algorithms from Static Definitions von Ediger, David, Fairbanks, James P.

“… Streaming graph algorithms that avoid unnecessary recomputation through clever application of data dependency analysis are often more complex to derive than their static counterparts …”
Volltext

Memgraph Unveils Streaming Graph Algorithms

Volltext

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms von Assadi, Sepehr, Raz, Ran

“… We prove that any two-pass graph streaming algorithm for the \(s\)-\(t\) reachability problem in \(n …”
Volltext

Memgraph Launches Streaming Graph Algorithms

Volltext

Memgraph Introduces Streaming Graph Algorithms

Volltext

Tracking local communities in streaming graphs with a dynamic algorithm von Zakrzewska, Anita, Bader, David A.

“… Greedy, agglomerative algorithms, which are commonly used in seed set expansion, have been previously designed only for a static, unchanging graph …”
Volltext

Fast shared-memory streaming multilevel graph partitioning von Jafari, Nazanin, Selvitopi, Oguz, Aykanat, Cevdet

“… The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the offline methods for partitioning graphs contain more involved …”
Volltext

CA-GNN: A Competence-Aware Graph Neural Network for Semi-Supervised Learning on Streaming Data von 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 …”
Volltext

A two-phase streaming edge partitioning algorithm for large-scale uncertain graphs von Cui, Huanqing, Chang, Anfu, Hu, Kekun, Dong, Gang, Zhu, Jinbin

“… However, existing partitioning algorithms are primarily designed for deterministic graphs, which do not account for edge uncertainties …”
Volltext