HIGHLIGHTS
- who: Thorsten Gu00f6tte from the Department of Computer Science, Paderborn University, Warburger Str100, Paderborn, Germany have published the Article: Time-optimal construction of overlay networks, in the Journal: (JOURNAL)
- what: The authors show how the algorithm can be used to efficiently solve graph problems in hybrid networks (Augustine the idea that nodes possess two different modes of communication the authors assume that communication of the initial edges is unrestricted whereas only polylogarithmically many messages can be sent over edges that have been established throughout an algorithm`s execution. For an (undirected) graph G with arbitrary . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.