Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

doi 10.1137/1.9781611975994.79

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial and Applied Mathematics

Related search

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

2020English

A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs

2018English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Lower Bounds for Dynamic Connectivity

2004English

Lower Bounds for Gaussian Estrada Index of Graphs

Symmetry
MathematicsChemistryPhysicsComputer ScienceAstronomy
2018English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

General Lower Bounds for the Minor Crossing Number of Graphs

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy