Performance Evaluation of Dynamic Labeling Schemes in Tree Networks – Københavns Universitet

Performance Evaluation of Dynamic Labeling Schemes in Tree Networks

Master thesis defence by Iasonas Zotos

Abstract:

Labeling scheme is the study of distribution of the structural information of a graph among its vertices. Dynamic labeling schemes are a subset of labeling schemes that has not been covered extensively by the current literature. Moreover, dynamic labeling schemes in tree networks is a eld that has only been covered in a theoretical level. We perform a performance evaluation via simulation for selected dynamic labeling schemes in tree networks. We present results that show the significance of message complexity over label size complexity on this sub-set of labeling schemes.

Place: Room 01-0-029 (APL-group meeting room)

Time: February 18, 4pm.

External Examiner: Rolf Fagerberg, IMADA, SDU

Supervisors: Marcos Vaz Salles, DIKU & Noy Rotbart, DIKU