Cargando…
Dynamic Graph Stream Algorithms in o(n) Space
In this paper we study graph problems in the dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require [Formula: see text] space, where n is the number of vertices, existing works mainly focused on designing [Formula: see tex...
Autores principales: | Huang, Zengfeng, Peng, Pan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6469696/ https://www.ncbi.nlm.nih.gov/pubmed/31057194 http://dx.doi.org/10.1007/s00453-018-0520-8 |
Ejemplares similares
-
Streaming Quantiles Algorithms with Small Space and Update Time
por: Ivkin, Nikita, et al.
Publicado: (2022) -
Mining Dynamic Graph Streams for Predictive Queries Under Resource Constraints
por: Liu, Xuanming, et al.
Publicado: (2020) -
Dynamical systems, graphs and algorithms
por: Osipenko, George
Publicado: (2007) -
StreAM-[Formula: see text] : algorithms for analyzing coarse grained RNA dynamics based on Markov models of connectivity-graphs
por: Jager, Sven, et al.
Publicado: (2017) -
Faucet: streaming de novo assembly graph construction
por: Rozov, Roye, et al.
Publicado: (2018)