Výsledky vyhľadávania - Graph Streaming Algorithms

Upresniť hľadanie
  1. 1

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

    ISSN: 0020-0190, 1872-6119
    Vydavateľské údaje: Amsterdam Elsevier B.V 30.04.2008
    Vydané v Information processing letters (30.04.2008)
    Získať plný text
    Journal Article
  2. 2

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

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 01.11.2020
    “…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…”
    Získať plný text
    Konferenčný príspevok..
  3. 3

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

    ISSN: 1045-9219, 1558-2183
    Vydavateľské údaje: IEEE 01.12.2024
    “… There has been little work on supporting time-respecting algorithms at large scales for streaming graphs, which are updated continuously at high rates (Millions…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 2198-5804, 2198-5812
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2021
    Vydané v Annals of data science (01.12.2021)
    “… 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…”
    Získať plný text
    Journal Article
  5. 5

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

    ISSN: 1066-8888, 0949-877X
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
    Vydané v The VLDB journal (01.06.2016)
    “… As a result, it is essential to develop efficient incremental algorithms for dynamic graph data…”
    Získať plný text
    Journal Article
  6. 6

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

    ISBN: 1538658151, 9781538658154
    Vydavateľské údaje: Piscataway, NJ, USA IEEE Press 01.05.2018
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  7. 7

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

    ISSN: 2751-4838, 2751-4838
    Vydavateľské údaje: TheoretiCS Foundation e.V 25.08.2023
    Vydané v TheoretiCS (25.08.2023)
    “…$-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…”
    Získať plný text
    Journal Article
  8. 8

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

    ISSN: 2168-9253
    Vydavateľské údaje: IEEE 01.09.2022
    “… 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…”
    Získať plný text
    Konferenčný príspevok..
  9. 9

    Memgraph Launches Streaming Graph Algorithms

    Vydavateľské údaje: Close-Up Media, Inc 16.10.2021
    Vydané v Entertainment Close-up (16.10.2021)
    Získať plný text
    Journal Article
  10. 10

    Memgraph Introduces Streaming Graph Algorithms

    Vydavateľské údaje: Close-Up Media, Inc 15.10.2021
    Vydané v Entertainment Close-up (15.10.2021)
    Získať plný text
    Journal Article
  11. 11

    Streaming Algorithms and Graph Connectivity Autor Wang, Zhengyu

    ISBN: 9798684635618
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2019
    “…) An optimal space lower bound for samplers. Samplers are used as the building blocks for streaming graph algorithms such as graph connectivity…”
    Získať plný text
    Dissertation
  12. 12

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

    Vydavateľské údaje: IEEE 01.05.2017
    “… Streaming graph algorithms that avoid unnecessary recomputation through clever application of data dependency analysis are often more complex to derive than their static counterparts…”
    Získať plný text
    Konferenčný príspevok..
  13. 13

    Memgraph Unveils Streaming Graph Algorithms

    Vydavateľské údaje: Jacksonville Close-Up Media, Inc 08.10.2021
    Vydané v Wireless News (08.10.2021)
    Získať plný text
    Newsletter
  14. 14

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 14.04.2023
    Vydané v arXiv.org (14.04.2023)
    “…We prove that any two-pass graph streaming algorithm for the \(s\)-\(t\) reachability problem in \(n…”
    Získať plný text
    Paper
  15. 15

    Memgraph Launches Streaming Graph Algorithms

    Vydavateľské údaje: Jacksonville Close-Up Media, Inc 16.10.2021
    Vydané v Entertainment Close - Up (16.10.2021)
    Získať plný text
    Newsletter
  16. 16

    Memgraph Introduces Streaming Graph Algorithms

    Vydavateľské údaje: Jacksonville Close-Up Media, Inc 15.10.2021
    Vydané v Entertainment Close - Up (15.10.2021)
    Získať plný text
    Newsletter
  17. 17

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

    ISSN: 1869-5450, 1869-5469
    Vydavateľské údaje: Vienna Springer Vienna 01.12.2016
    Vydané v Social network analysis and mining (01.12.2016)
    “… Greedy, agglomerative algorithms, which are commonly used in seed set expansion, have been previously designed only for a static, unchanging graph…”
    Získať plný text
    Journal Article
  18. 18

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

    ISSN: 0743-7315, 1096-0848
    Vydavateľské údaje: United States Elsevier Inc 01.01.2021
    “… 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…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Vydavateľské údaje: United States IEEE 01.02.2025
    Vydané v IEEE transactions on cybernetics (01.02.2025)
    “…) 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…”
    Získať plný text
    Journal Article
  20. 20

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

    ISSN: 1386-7857, 1573-7543
    Vydavateľské údaje: New York Springer US 01.10.2025
    Vydané v Cluster computing (01.10.2025)
    “… However, existing partitioning algorithms are primarily designed for deterministic graphs, which do not account for edge uncertainties…”
    Získať plný text
    Journal Article