Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

DOI10.1137/1.9781611975994.79MaRDI QIDQ5146852zbMATH OpenOpenAlexFDO

Authors Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1908.01956

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• Equivalence classes and conditional hardness in massively parallel computations
• scientific article; zbMATH DE number 7651141 (Why is no real title available?)
• Fully dynamic sequential and distributed algorithms for MAX-CUT
• Dynamic maximal matching in clique networks
• Streaming graph algorithms in the massively parallel computation model
• The parallel dynamic complexity of the abelian Cayley group membership problem
• Capacitated max-batching with interval graph compatibilities

This page was built for publication: Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146852)