Spanners of Complete $k$-Partite Geometric Graphs

Details Spanners of Complete $k$-Partite Geometric Graphs Spanners of Complete $k$-Partite Geometric Graphs

2007-12-04

arxiv.org/abs/0712.0554v1

Computer Science

Computational Geometry

Scientific paper

We address the following problem: Given a complete $k$-partite geometric graph $K$ whose vertex set is a set of $n$ points in $\mathbb{R}^d$, compute a spanner of $K$ that has a ``small'' stretch factor and ``few'' edges. We present two algorithms for this problem. The first algorithm computes a $(5+\epsilon)$-spanner of $K$ with O(n) edges in $O(n \log n)$ time. The second algorithm computes a $(3+\epsilon)$-spanner of $K$ with $O(n \log n)$ edges in $O(n \log n)$ time. The latter result is optimal: We show that for any $2 \leq k \leq n - \Theta(\sqrt{n \log n})$, spanners with $O(n \log n)$ edges and stretch factor less than 3 do not exist for all complete $k$-partite geometric graphs.

Affiliated with

Also associated with

No associations

Rating

Spanners of Complete $k$-Partite Geometric Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spanners of Complete $k$-Partite Geometric Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spanners of Complete $k$-Partite Geometric Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682147