Spanners of complete k-Partite geometric graphs

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel Smid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We address the following problem: Given a complete k-partite geometric graph K whose vertex set is a set of n points in ℝ 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∈+∈ε)-spanner of K with O(n) edges in O(n logn) time. The second algorithm computes a (3∈+∈ε)-spanner of K with O(n logn) edges in O(n logn) time. Finally, we show that there exist complete k-partite geometric graphs K such that every subgraph of K with a subquadratic number of edges has stretch factor at least 3.

Original languageEnglish
Title of host publicationLATIN 2008
Subtitle of host publicationTheoretical Informatics - 8th Latin American Symposium, Proceedings
Number of pages12
StatePublished - 12 May 2008
Externally publishedYes
Event8th Latin American TheoreticalINformatics Symposium, LATIN 2008 - Buzios, Brazil
Duration: 7 Apr 200811 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4957 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th Latin American TheoreticalINformatics Symposium, LATIN 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Spanners of complete k-Partite geometric graphs'. Together they form a unique fingerprint.

Cite this