S. Akers, D. Harel, and B. Krishnamurthy, The star graph: an attractive alternative t o t h e n-cube, Proceedings of the International Conference on Parallel Processing, pp.393-400, 1987.

C. Berge, Graphes et Hypergraphes. Dunod, 1973.

J. Bermond and P. Raigniaud, Broadcasting and NP-Completeness, Graph Theory Notes of, pp.8-14, 1992.

J. Bermond, P. , and J. Peters, Antepenultimate broadcasting. Networks
DOI : 10.1002/net.3230260302

J. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro, Optimal gossiping by short messages, Dipartimento di Informatica ed Applicazioni
DOI : 10.1016/s0166-218x(98)00022-5

URL : https://doi.org/10.1016/s0166-218x(98)00022-5

L. Bomans and D. Roose, Communication benchmarks for the iPSC/2, Hypercube and Distributed Computers, pp.311-328, 1989.

G. Cybenko, D. W. Krumme, and K. N. Venkataraman, Gossiping in minimum time, SIAM Journal on Computing, vol.21, issue.1, pp.111-139, 1992.

J. Edmonds, Edge-disjoint branchings, combinatorial algorithms, Combinatorial Algorithms 91-96, 1972.

S. Even and B. Monien, On the number of rounds necessary to disseminate information, ACM Symposium on Parallel Algorithms and Architectures, 1989.

A. Farley and A. Proskurowski, Gossiping in grid graphs, Journal of Combinatorics Information and Systems Science, vol.5, pp.161-172, 1980.

U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Randomized broadcast in networks, International Symposium SIGAL'90, pp.128-137, 1990.

P. Raigniaud, Performance analysis of broadcasting in hypercubes with restricted communication capabilities, Journal of Parallel and Distributed Computing, vol.16, issue.1, pp.15-26, 1992.

P. Raigniaud and C. Laforest, Disjoint spanning trees of small depth, Parallel Computing: Trends and Applications, 1994.

P. Raigniaud and E. Lazard, Methods and Problems of Communication in Usual Networks, Discrete Applied Mathematics, vol.53, pp.79-133, 1994.

P. Raigniaud and J. Peters, Minimum linear gossip graphs and maximal linear ( k )-gossip graphs, pp.1-9

M. Garey and D. Johnson, Computers and Intractability: a guide to theory of NP-completeness, 1979.

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.18, pp.319-349, 1986.

J. Hromkovic, C. Jeschke, and B. Monien, Optimal algorithms for dissemination of information in some interconnection networks, 1990.

J. Hromkovic, R. Klasing, B. Monien, and R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping), 1993.

J. Hromkovic, R. Klasing, D. Pardubska, W. Unger, J. Waczulic et al., EEective systolic algorithms for gossiping in cycles and two-dimensional grids, 10-th International Conference o n F undamentals of Computation Theory (FCT95)

J. Hromkovic, R. Klasing, D. Pardubska, W. Unger, and H. Wagener, The complexity of systolic dissemination of information in interconnection networks, 4-th Scandinavian Workshop on Algorithm Theory (SWAT94), n umber 824 in Lecture Notes in Computer Science, pp.219-230, 1994.

S. L. Johnsson and C. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Transaction on Computers, vol.38, issue.9, pp.1249-1268, 1989.

W. Knodel, New gossips and telephones. Discrete Mathematics, vol.13, p.95, 1975.

G. Kortsarz and D. Peleg, Approximation algorithms for minimum time broadcast, Proceedings of the 1992 Israel Symposium on Theory of Computer Science, number 601 in Lecture Notes in Computer Science, 1992.

D. J. Krumme, Fast gossiping for the hypercube, SIAM Journal on Computing, vol.21, issue.2, pp.365-380, 1992.

S. Kundu, Bounds on the number of disjoint spanning trees, Journal of Combinatorical Theory, vol.17, pp.199-203, 1974.

R. Labahn, Some minimum gossip graphs, Networks, vol.23, pp.333-341, 1993.
DOI : 10.1002/net.3230230416

R. Labahn, S. Hedetniemi, and R. Laskar, Periodic gossiping on trees, Discrete Applied Mathematics, vol.53, pp.235-245, 1994.

R. Labahn and I. Warnke, Quick gossiping by telegraphs, Discrete Mathematics, vol.126, pp.421-424, 1994.
DOI : 10.1016/0012-365x(94)90290-9

URL : https://doi.org/10.1016/0012-365x(94)90290-9

T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, 1992.

A. Liestman and D. Richards, Network communication in edge-colored graphs: gossiping, IEEE Transaction on Parallel and Distributed Systems, vol.4, issue.4, pp.438-445, 1993.

L. Lovasz, On two minimax theorems in graph theory, J. Combinatorial Theory, B, issue.21, pp.96-103, 1976.

W. Mccuaig, A simple proof of menger's theorem, Journal of Graph Theory, vol.8, pp.427-429, 1984.

M. Middendorf, Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2, Information Processing Letters, vol.46, pp.281-287, 1993.

F. Preparata and J. Vuillemin, The cube connected cycles: a versatile network for parallel computation, Communications of the ACM, vol.24, issue.5, pp.300-309, 1981.

R. Ravi, Rapid rumor ramiication: approximating the minimum broadcast time, 35-th Symposium on Foundations of Computer Science, 1994.

P. and G. Wu, Heuristic algorithms for broadcasting in point-to-point computer networks, IEEE Transaction on Computers, C, vol.33, issue.9, pp.804-811

P. Slater, S. Cockayne, and . Hedetniemi, Information dissemination in trees, SIAM Journal on Computing, vol.10, issue.4, pp.692-701, 1981.

Q. F. Stout and B. Wagar, Intensive h ypercube communication, prearranged communication in link-bound machines, Journal of Parallel and Distributed Computing, vol.10, pp.167-181, 1990.

V. S. Sunderam and P. Winkler, Fast information sharing in a distributed system, Discrete Applied Mathematics, vol.42, pp.75-86, 1993.

J. Ventura and X. Weng, A new method for constructing minimal broadcast networks, Networks, vol.23, pp.481-497, 1993.