The following pages link to Generating Sparse 2-Spanners (Q4312222):
Displaying 26 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Randomized priority algorithms (Q974749) (← 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)
- Sparse hypercube 3-spanners (Q1570842) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- (Q6065466) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
- Complexity of the multiobjective minimum weight minimum stretch spanner problem (Q6616272) (← links)
- Covering a graph with densest subgraphs (Q6659505) (← links)
