Concurrent transmissions in broadcast networks

  • Charles J. Colbourn
  • Andrzej Proskurowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


A linear time algorithm for determining the maximal number of collision-free transmissions in an arbitrary series-parallel network is developed. The method operates by a recursive contraction of the network to a single edge; during this contraction process, information is retained concerning each of the subnetworks which has been eliminated. This efficient solution contrasts with the known NP-completeness of the problem for general networks.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N. Abramson, "The ALOHA System — Another Alternative for Computer Communications", Proc. AFIPS FJCC 37 (1970).Google Scholar
  2. [2]
    R.J. Duffin, "Topology of series-parallel networks", J. Math. Anal. Appl. 10 (1965) 303–318.Google Scholar
  3. [3]
    S. Even, O. Goldreich and P. Tong, "On the NP-completeness of certain network testing problems", TR 230, Computer Science Department, Technion, Haifa, Israel.Google Scholar
  4. [4]
    A.M. Farley, "Networks immune to isolated failures", Networks 11 (1981) 255–268.Google Scholar
  5. [5]
    A.M. Farley and A. Proskurowski, "Networks immune to isolated line failures", Networks 12 (1982) 393–403.Google Scholar
  6. [6]
    A.M. Farley and A. Proskurowski, "On computing the open irredundance number of a tree", Proceedings of the Second West Coast Conference on Computing in Graph Theory, Eugene OR, 1983, proceedings to appear, also Technical Report UO-CIS-TR-83-/4, Dept. of Computer and Information Science, University of Oregon, 1983.Google Scholar
  7. [7]
    A.M. Farley and N. Shacham, "Senders in Broadcast Networks: Open Irredundancy in Graphs", Congressus Numerantium 38 (1983) 47–57.Google Scholar
  8. [8]
    E.M. Neufeld and C.J. Colbourn, "The most reliable series-parallel networks", Networks, to appear.Google Scholar
  9. [9]
    D.J. Rose, "On simple characterizations of k-trees", Discrete Math. 7 (1974) 317–322.Google Scholar
  10. [10]
    J.A. Wald and C.J. Colbourn, "Steiner trees, partial 2-trees, and minimum IFI networks", Networks 13 (1983) 159–167.Google Scholar
  11. [11]
    J.A. Wald and C.J. Colbourn, "Steiner trees in probabilistic networks", Microelectronics and Reliability 23 (1983) 837–840.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Charles J. Colbourn
    • 1
  • Andrzej Proskurowski
    • 2
  1. 1.Department of Computational ScienceUniversity of SaskatchewanSaskatoonCanada
  2. 2.Department of Computing ScienceRoyal Institute of TechnologyStockholm 70Sweden

Personalised recommendations