Two open problems in communication in edge-disjoint paths modes
Acta Mathematica et Informatica Universitatis Ostraviensis (1999)
- Volume: 07, Issue: 1, page 109-117
- ISSN: 1804-1388
Access Full Article
top
How to cite
topBöckenhauer, Hans-Joachim. "Two open problems in communication in edge-disjoint paths modes." Acta Mathematica et Informatica Universitatis Ostraviensis 07.1 (1999): 109-117. <http://eudml.org/doc/23830>.
@article{Böckenhauer1999,
author = {Böckenhauer, Hans-Joachim},
journal = {Acta Mathematica et Informatica Universitatis Ostraviensis},
keywords = {communication algorithms; parallel computations; broadcast complexity},
language = {eng},
number = {1},
pages = {109-117},
publisher = {University of Ostrava},
title = {Two open problems in communication in edge-disjoint paths modes},
url = {http://eudml.org/doc/23830},
volume = {07},
year = {1999},
}
TY - JOUR
AU - Böckenhauer, Hans-Joachim
TI - Two open problems in communication in edge-disjoint paths modes
JO - Acta Mathematica et Informatica Universitatis Ostraviensis
PY - 1999
PB - University of Ostrava
VL - 07
IS - 1
SP - 109
EP - 117
LA - eng
KW - communication algorithms; parallel computations; broadcast complexity
UR - http://eudml.org/doc/23830
ER -
References
top- Farley A.M., Minimum-Time Line Broadcast Networks, Networks, 10:59-70, 1994. (1994) MR0565325
- R. Feldmann J. Hromkovič S. Madhavapeddy B. Monien P. Mysliwietz, 10.1016/0166-218X(94)90179-1, Discrete Applied Mathematics 53, No. 1-3, 55-78, 1994. (1994) MR1291002DOI10.1016/0166-218X(94)90179-1
- P. Fraigniaud E. Lazard, 10.1016/0166-218X(94)90180-5, Discrete Applied Mathematics 53, No. 1-3, 79-133, 1994. (1994) MR1291003DOI10.1016/0166-218X(94)90180-5
- S. M. Hedetniemi S. T. Hedetniemi A. L. Liestman, A Survey of Gossiping and Broadcasting in Communication Networks, Networks, 18:319-349, 1998. (1998)
- 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. (1995) MR1382871
- 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. (1996) MR1424352
- Hromkovič J., Klasing R., Stöhr E. A., Wagener H., 10.1006/inco.1995.1154, Information and Computation 123, No. 1, pp. 17-28, 1995. (1995) MR1358964DOI10.1006/inco.1995.1154
- 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). MR1436767
- 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.
- 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. (19th)
- R. Klasing, On the Complexity of Broadcast and Gossip in Different Communication Modes, Shaker Verlag, Aachen, 1996. (1996)
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.