Methods and problems of communication in usual networks

This publication has 67 references indexed in Scilit:

• Fast gossiping on square mesh computers
  Information Processing Letters, 1993
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
  Information Processing Letters, 1993
• The cost of broadcasting on star graphs and k-ary hypercubes
  IEEE Transactions on Computers, 1993
• Network communication in edge-colored graphs: gossiping
  IEEE Transactions on Parallel and Distributed Systems, 1993
• Optimal algorithms for total exchange without buffering on the hypercube
  BIT Numerical Mathematics, 1992
• Optimal broadcasting on the star graph
  IEEE Transactions on Parallel and Distributed Systems, 1992
• Broadcasting in the Butterfly network
  Information Processing Letters, 1991
• Optimum broadcasting and personalized communication in hypercubes
  IEEE Transactions on Computers, 1989
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
  Networks, 1989
• New gossips and telephones
  Discrete Mathematics, 1975