Pages that link to "Item:Q1196368"
From MaRDI portal
The following pages link to On sparse spanners of weighted graphs (Q1196368):
Displaying 50 items.
- Consistency thresholds for the planted bisection model (Q287720) (← links)
- On resilient graph spanners (Q289925) (← links)
- The MST of symmetric disk graphs is light (Q425622) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Edge-disjoint spanners in tori (Q1025482) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- Constructing sparse spanners for most graphs in higher dimensions (Q1336765) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- New pairwise spanners (Q1693988) (← links)
- Spanners for geodesic graphs and visibility graphs (Q1709579) (← links)
- On the VC-dimension of unique round-trip shortest path systems (Q1730015) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Neighborhood hypergraph model for topological data analysis (Q2111089) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Graph coarsening: from scientific computing to machine learning (Q2128866) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes (Q2224857) (← links)
