![]() ![]() Keywords Routing scheme ġ Introduction Routing in graphs constitutes a fundamental problem in distributed graph algorithms. Ε > 0, we show how to construct a routing scheme for UD(S) with stretch 1 ε using labels of O(log n) bits and routing tables of O(ε−5 log2 n log2 D) bits, where D is the (Euclidean) diameter of UD(S). Institut für Informatik, Freie Universität Berlin, Berlin, Germanyĭepartment of Computer Science, Bar Ilan University, Ramat Gan, Israel School of Computer Science, Tel Aviv University, Tel Aviv, Israel Wolfgang Mulzer Haim Kaplan Liam Roditty Paul Seiferth A preliminary version appeared as Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. This work is supported in part by GIF project 1161
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |