Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 04, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Shakhar Smorodinsky

On Locally Delaunay Geometric Graphs

A geometric graph is a simple graph G=(V,E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said to be k-locally Delaunay (or a Dk-graph) if for each edge (u,v) \in E there is a disc d that contains u and v but no other vertex of G that has distance at most k (in the graph-theoretical sense) from u or v. Note that a Delaunay graph is k-locally Delaunay for any k.

The study of these graphs was recently motivated by topology control for wireless networks.

In this talk we study the maximum edge complexity of such graphs.

(Joint work with Rom Pinchasi )


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login