Search Results - "Graph Streaming Algorithms"

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

Authors: Sepehr Assadi Ran Raz

Source: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). :342-353

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences

Access URL: http://arxiv.org/pdf/2009.01161
http://arxiv.org/abs/2009.01161
https://www.researchwithrutgers.com/en/publications/near-quadratic-lower-bounds-for-two-pass-graph-streaming-algorith-2
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-01161
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-01161
https://collaborate.princeton.edu/en/publications/near-quadratic-lower-bounds-for-two-pass-graph-streaming-algorith

Polynomial pass lower bounds for graph streaming algorithms

Authors: Sanjeev Khanna Sepehr Assadi Yu Chen

Source: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. :265-276

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/abs/1904.04720
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-04720
http://arxiv.org/pdf/1904.04720.pdf
https://www.researchwithrutgers.com/en/publications/polynomial-pass-lower-bounds-for-graph-streaming-algorithms
https://arxiv.org/abs/1904.04720
https://dl.acm.org/doi/pdf/10.1145/3313276.3316361

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

Authors: Assadi, Sepehr Raz, Ran

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2009.01161

Polynomial Pass Lower Bounds for Graph Streaming Algorithms

Authors: Assadi, Sepehr Chen, Yu Khanna, Sanjeev

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1904.04720

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT

Authors: Dong, Yinhao Peng, Pan Vakilian, Ali et al.

Contributors: Dong, Yinhao Peng, Pan Vakilian, Ali et al.

Subject Terms: Graph Streaming Algorithms, FOS: Computer and information sciences, Learning-Augmented Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), MAX-CUT, ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2412.09773
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.44

Space Optimal Vertex Cover in Dynamic Streams

Authors: Naidu, Kheeran K. Shah, Vihan Kheeran K. Naidu and Vihan Shah

Contributors: Naidu, Kheeran K. Shah, Vihan Kheeran K. Naidu and Vihan Shah

Subject Terms: Graph Streaming Algorithms, Vertex Cover, Dynamic Streams, Approximation Algorithm

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.53

Availability: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.53
https://nbn-resolving.org/urn:nbn:de:0030-drops-171753
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.53

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

Authors: Assadi, Sepehr Shah, Vihan Sepehr Assadi and Vihan Shah

Contributors: Assadi, Sepehr Shah, Vihan Sepehr Assadi and Vihan Shah

Subject Terms: FOS: Computer and information sciences, Sketching, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Maximum matching, 0102 computer and information sciences, ddc:004, Graph streaming algorithms, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2201.12710
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.9

Testable Properties in General Graphs and Random Order Streaming

Authors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Contributors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Subject Terms: Graph property testing, sublinear algorithms, graph streaming algorithms

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Availability: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.16
https://nbn-resolving.org/urn:nbn:de:0030-drops-126190
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Testable Bounded Degree Graph Properties Are Random Order Streamable

Authors: Monemizadeh, Morteza Muthukrishnan, S. Peng, Pan et al.

Contributors: Monemizadeh, Morteza Muthukrishnan, S. Peng, Pan et al.

Subject Terms: Graph streaming algorithms, graph property testing, constant-time approximation algorithms

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.131

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2017.131
https://nbn-resolving.org/urn:nbn:de:0030-drops-74782
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.131

Testable Properties in General Graphs and Random Order Streaming

Authors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Contributors: Czumaj, Artur Fichtenberger, Hendrik Peng, Pan et al.

Subject Terms: FOS: Computer and information sciences, sublinear algorithms, TK, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph property testing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, QA, graph streaming algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/1905.01644
http://wrap.warwick.ac.uk/139228/1/main.pdf
https://arxiv.org/abs/1905.01644
https://eprints.whiterose.ac.uk/162666/
https://drops.dagstuhl.de/opus/volltexte/2020/12619/pdf/LIPIcs-APPROX16.pdf/
http://wrap.warwick.ac.uk/139228/
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.16
https://dblp.uni-trier.de/db/journals/corr/corr1905.html#abs-1905-01644
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy

Authors: Assadi, Sepehr Ghosh, Prantar Loff, Bruno et al.

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2405.14835

Sketching Approximability of All Finite CSPs.

Authors: Chou, Chi-Ning Golovnev, Alexander Sudan, Madhu et al.

Source: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-74, 74p

Subject Terms: CONSTRAINT satisfaction, BOOLEAN functions, SEPARATION of variables, FOURIER analysis, APPROXIMATION algorithms, COMMUNICATION barriers, HYPERCUBES

Approximately Counting Subgraphs in Data Streams

Authors: Fichtenberger, Hendrik Peng, Pan

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2203.14225

Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma

Authors: Assadi, Sepehr N, Vishvajeet

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2104.04908

Streaming algorithms for triangle counting: adversarial robustness and the weighted case.

Authors: Cao, Jing Pan, Yicheng Peng, Pan

Source: Frontiers of Computer Science; Jan2026, Vol. 20 Issue 1, p1-3, 3p

Parameterized Complexity of Streaming Diameter and Connectivity Problems.

Authors: Oostveen, Jelle J. van Leeuwen, Erik Jan

Source: Algorithmica; Sep2024, Vol. 86 Issue 9, p2885-2928, 44p

Subject Terms: GRAPH algorithms, STREAMING video & television, DIAMETER

GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive).

Authors: Tench, David West, Evan Zhang, Victor et al.

Source: ACM Transactions on Database Systems; Sep2024, Vol. 49 Issue 3, p1-31, 31p

Subject Terms: ARTIFICIAL intelligence, DATA structures, HIGH performance computing, INFORMATION storage & retrieval systems, DENSE graphs, PARALLEL algorithms, GRAPH algorithms

STRATEGYPROOFNESS-EXPOSING MECHANISM DESCRIPTIONS.

Authors: Gonczarowski, Yannai A. Heffetz, Ori Thomas, Clayton

Source: NBER Working Papers; Jul2023, Issue 31417-31505, p1-87, 89p

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.

Authors: Bishnu, Arijit Ghosh, Arijit Kolay, Sudeshna et al.

Source: Theory of Computing Systems; Dec2023, Vol. 67 Issue 6, p1241-1267, 27p

Subject Terms: TRIANGLES, COMPUTABLE functions, GRAPH algorithms, PARAMETERIZATION, TRANSVERSAL lines

Promised streaming algorithms and finding pseudo-repetitions

Authors: Tiseanu, Catalin Stefan

Index Terms: Computer science, algorithms, combinatorial properties, data streams, graph streaming, lower bounds, Thesis

URL: http://hdl.handle.net/1903/14455