scientific article; zbMATH DE number 7238981
From MaRDI portal
Publication:5116490
DOI10.4230/LIPIcs.SWAT.2018.26zbMath1477.68230arXiv1802.06271MaRDI QIDQ5116490
Publication date: 25 August 2020
Full work available at URL: https://arxiv.org/abs/1802.06271
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
Unnamed Item ⋮ Nearly Work-Efficient Parallel Algorithm for Digraph Reachability ⋮ Graph spanners: a tutorial review ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ New Results on Linear Size Distance Preservers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convex hull of the integer points in a large ball
- Very Sparse Additive Spanners and Emulators
- Additive Spanners: A Simple Construction
- Additive spanners and (α, β)-spanners
- Sparse Sourcewise and Pairwise Distance Preservers
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Better Distance Preservers and Additive Spanners
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners
- Linear Size Distance Preservers
- The 4/3 Additive Spanner Exponent Is Tight
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- Testing subgraphs in large graphs
- Shortcutting Planar Digraphs
- All-Pairs Almost Shortest Paths
- Nearly work-efficient parallel algorithm for digraph reachability
- New Additive Spanners
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
This page was built for publication:
