Geodesic
Two open problems in communication in edge-disjoint paths modes
Communications in Mathematics, Tome 7 (1999) no. 1, pp. 109-117 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68M10, 68W10, 68W15, 90B18, 94A05 
@article{COMIM_1999_7_1_a8,
     author = {B\"ockenhauer, Hans-Joachim},
     title = {Two open problems in communication in edge-disjoint paths modes},
     journal = {Communications in Mathematics},
     pages = {109--117},
     year = {1999},
     volume = {7},
     number = {1},
     mrnumber = {1724132},
     zbl = {1030.90010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/COMIM_1999_7_1_a8/}
}
TY  - JOUR
AU  - Böckenhauer, Hans-Joachim
TI  - Two open problems in communication in edge-disjoint paths modes
JO  - Communications in Mathematics
PY  - 1999
SP  - 109
EP  - 117
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/COMIM_1999_7_1_a8/
LA  - en
ID  - COMIM_1999_7_1_a8
ER  - 
%0 Journal Article
%A Böckenhauer, Hans-Joachim
%T Two open problems in communication in edge-disjoint paths modes
%J Communications in Mathematics
%D 1999
%P 109-117
%V 7
%N 1
%U http://geodesic.mathdoc.fr/item/COMIM_1999_7_1_a8/
%G en
%F COMIM_1999_7_1_a8
Böckenhauer, Hans-Joachim. Two open problems in communication in edge-disjoint paths modes. Communications in Mathematics, Tome 7 (1999) no. 1, pp. 109-117. http://geodesic.mathdoc.fr/item/COMIM_1999_7_1_a8/

[1] Farley A.M.: Minimum-Time Line Broadcast Networks. Networks, 10:59-70, 1994. | MR

[2] R. Feldmann J. Hromkovič S. Madhavapeddy B. Monien P. Mysliwietz: Optimal algorithms for dissemination of information in generalized communication modes. Discrete Applied Mathematics 53, No. 1-3, 55-78, 1994. | DOI | MR

[3] P. Fraigniaud E. Lazard: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53, No. 1-3, 79-133, 1994. | DOI | MR

[4] S. M. Hedetniemi S. T. Hedetniemi A. L. Liestman: A Survey of Gossiping and Broadcasting in Communication Networks. Networks, 18:319-349, 1998.

[5] J. Hromkovič R. Klasing B. Monien R. Peine: Dissemination of information in interconnection networks (broadcasting and gossiping). In: D.-Z. Du and F. Hsu, editors, Combinatorial Network Theory, Kluwer Academic Publishers, 125-212, 1995. | MR

[6] J. Hromkovič R. Klasing E.A. Stöhr: Dissemination of Information in Vertex- Disjoint Paths Mode. Computers and Artificial Intelligence, Vol. 15, No. 4, 295-318, 1996. | MR

[7] Hromkovič J., Klasing R., Stöhr E. A., Wagener H.: Gossiping in Vertex- Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Information and Computation 123, No. 1, pp. 17-28, 1995. | DOI | MR

[8] J. Hromkovič R. Klasing W. Unger H. Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Information and Computation (to appear). | MR

[9] J. Hromkovič K. Lorys P. Kanarek R. Klasing W. Unger H. Wagener: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. Proc of the 12th Symposium on Theoretical Aspects of Computer Science (STACS'95), Springer LNCS 900, pp. 255-266.

[10] R. Klasing: The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. Proc. of the 19th International Symposium on Mathematical Foundations of Computer Science (MFCS'94), Springer LNCS 841, pp. 473-483. Discrete Applied Mathematics, to appear.

[11] R. Klasing: On the Complexity of Broadcast and Gossip in Different Communication Modes. Shaker Verlag, Aachen, 1996.