scientific article; zbMATH DE number 7561582

DOI10.4230/LIPIcs.ICALP.2019.89MaRDI QIDQ5091249

Eylon Yogev, Merav Parter

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cycle decompositiongraph sparsificationlow-congestion cycle cover

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

Invited talk: Resilient distributed algorithms ⋮ Distributed computations in fully-defective networks ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions

Cites Work

• Unnamed Item
• On Sketching Quadratic Forms
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Distributed Computing: A Locality-Sensitive Approach
• Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
• Twice-Ramanujan Sparsifiers
• Towards Resistance Sparsifiers

This page was built for publication: