Permutation routing and gossiping on the graph G (n,k) of the Johnson Scheme

Permutation routing and gossiping on the graph G (n,k) of the Johnson Scheme

Bibliografski detalji
Izdano u:Philippine computing journal 3, 1(O) (2008).
Glavni autor: Caro, Jaime D.L
Daljnji autori: Ho, Hans Riyono
Format: Članak
Jezik:English
Teme:
Johnson scheme.
Algorithms.
Packet routing.
Online pristup:https://docs.google.com/a/engglib2.upd.edu.ph/file/d/0BxI8feCZhWsobHpUX1N2TDM0SUk/edit