Searching for "Sparse Graph Spanners." – sorted by Relevance.
-
Additive spanners for k-chordal graphs
- . Classification: Algorithms, Sparse Graph Spanners 1 Introduction Let G =(V,E) be a connected graph with n
- Cited by 7 (3 self) – Add To MetaCart
-
Distributed proximity maintenance in ad hoc mobile networks
- . The D-SPANNER is a kinetic sparse graph spanner on the nodes that allows each node to quickly determine
- Cited by 5 (2 self) – Add To MetaCart
-
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- genus graphs. 1 Introduction The concept of sparse graph spanners was introduced in [28] and [29
- Cited by 1 (0 self) – Add To MetaCart
-
A General Framework for Vertex Orderings, with Applications to Netlist Clustering
- that minimizes the "perimeter" of the resulting cluster. For constructing sparse graph spanners, Peleg
- Cited by 31 (12 self) – Add To MetaCart
-
Prim-Dijkstra Tradeoffs for Improved Performance-Driven Routing Tree Design
- by two groups; see Section 3.2 below). Finally, the topic of sparse graph spanners has been treated
- Cited by 24 (4 self) – Add To MetaCart

