Graph spanners
From MaRDI portal
Recommendations
- Spanners in sparse graphs
- Spanners in Sparse Graphs
- scientific article; zbMATH DE number 1301100
- scientific article; zbMATH DE number 434498
- Drawing graphs as spanners
- Drawing graphs as spanners
- Graph spanners: a tutorial review
- Additive graph spanners
- Spanning paths in graphs
- Spanners for directed transmission graphs
Cited in
(only showing first 100 items - show all)- Demand-aware network designs of bounded degree
- Sparse hop spanners for unit disk graphs
- scientific article; zbMATH DE number 1301100 (Why is no real title available?)
- Span of a Graph: Keeping the Safety Distance
- Graph spanners: a tutorial review
- Spanders: distributed spanning expanders
- Steiner transitive-closure spanners of low-dimensional posets
- Tight bounds on the message complexity of distributed tree verification
- Activity preserving graph simplification
- Steiner transitive-closure spanners of low-dimensional posets
- Constructing Light Spanners Deterministically in Near-Linear Time
- Vertex fault-tolerant spanners for weighted points in polygonal domains
- Steiner shallow-light trees are exponentially lighter than spanning ones
- On the dilation spectrum of paths, cycles, and trees
- Computing the greedy spanner in linear space
- Generating sparse 2—spanners
- Graphs with bounded induced distance
- Edge-disjoint spanners in tori
- Multipath spanners via fault-tolerant spanners
- Spanners in graphs of bounded degree
- Spanner approximations in practice
- Online spanners in metric spaces
- Lower bounds on treespan
- Approximating Euclidean distances by small degree graphs
- Approximate shortest paths guided by a small index
- Distance-Preserving Graph Contractions
- Distance-Preserving Graph Contractions
- Small stretch ( , )-spanners in the streaming model
- Spanners in sparse graphs
- Sparse reliable graph backbones
- Generating sparse spanners for weighted graphs
- Lasserre integrality gaps for graph spanners and related problems
- Collective tree spanners in graphs with bounded parameters
- Covering Metric Spaces by Few Trees
- Optimal spanners for axis-aligned rectangles
- Greedy spanners in Euclidean spaces admit sublinear separators
- Optimal tree 3-spanners in directed path graphs
- A general framework for graph sparsification
- Lightweight near-additive spanners
- Small hop-diameter sparse spanners for doubling metrics
- Structural characterizations of tree t-spanners for graphs with few P₄'s and (0, )-graphs
- Compact and localized distributed data structures
- Making asynchronous distributed computations robust to noise
- Congested clique algorithms for graph spanners
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
- Parameterized Complexity of Directed Spanner Problems.
- Graph reduction with spectral and cut guarantees
- scientific article; zbMATH DE number 2014474 (Why is no real title available?)
- Measuring sample quality with diffusions
- Spanners of de Bruijn and Kautz graphs
- Spanners of underlying graphs of iterated line digraphs
- The Topological Fortress of Termites
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Tree spanners in planar graphs
- Deterministic improved round-trip spanners
- Preprocess, set, query!
- Improved sourcewise roundtrip spanners with constant stretch
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Rumor spreading with no dependence on conductance
- (k,+)-distance-hereditary graphs
- Additive graph spanners
- Region-fault tolerant geometric spanners
- Computing the greedy spanner in near-quadratic time
- Approximation algorithms for directed weighted spanners
- Distributed spanner approximation
- Source-wise round-trip spanners
- Distributed distance computation and routing with small messages
- Transitive-closure spanners: a survey
- Combinatorial network abstraction by trees and distances
- Collective additive tree spanners for circle graphs and polygonal graphs
- Geometric spanners with applications in wireless networks
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Graphs with minimum spanner (G)2-1
- scientific article; zbMATH DE number 7376014 (Why is no real title available?)
- Additive sparsification of CSPs
- A hierarchy of lower bounds for sublinear additive spanners
- Distance-preserving subgraphs of interval graphs
- Graph spanners in the streaming model: An experimental study
- The geometry of graphs and some of its algorithmic applications
- NP-completeness of minimum spanner problems
- Networks with small stretch number
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Lossless prioritized embeddings
- Simple distributed spanners in dense congest networks
- The sparsest additive spanner via multiple weighted BFS trees
- A fast algorithm for source-wise round-trip spanners
- On sparse spanners of weighted graphs
- ON SPANNERS OF GEOMETRIC GRAPHS
- Cutting Corners Cheaply, or How to Remove Steiner Points
- Tree spanners on chordal graphs: complexity and algorithms
- Light Euclidean Steiner spanners in the plane
- On the edge crossings of the greedy spanner
- Reliable spanners for metric spaces
- Spanners of bounded degree graphs
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- Models and algorithms for network reduction
- Minimum \(t\)-spanners on subcubic graphs
- Parameterized complexity of directed spanner problems
- scientific article; zbMATH DE number 7561636 (Why is no real title available?)
This page was built for publication: Graph spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826599)
