04/01/2015
Hi Friends
Tomorrow one of our friend name Muslem Al-Saidi defining Thesis, I request you to please come and know about new topic.
More details:
Topic: Balanced Disk Separators and Hierarchical Tree Decomposition of Real-life Networks
Date: Wednesday, April 1, 2015
Time: 1:00
Place: 274 MSB
Committee Members:
Feodor Dragan, Advisor
Hassan Peyravi
Mikhail Nesterenko
Abstract:
Recently in few papers, a balanced disk separator of graphs were recursively used to construct one or a small set of spanning trees that sharply approximate distances in a given graph. The best up to date approximation algorithms were obtained for multiplicative tree spanners and for collective additive tree spanners of graphs. In this thesis, we analyze a number of real-life networks, arising in Internet measurements, social and biological sciences, and demonstrate that they all admit small radius balanced disk separators. As a consequence, the one-to-one distances in those networks can be sharply approximated by the tree metrics. Furthermore, all those networks admit very simple distance and routing labeling schemes.
Thank you,
CSGSA.