Optimum Communication Spanning Trees in Series-Parallel Networks

This publication has 12 references indexed in Scilit:

• Network Design and Transportation Planning: Models and Algorithms
  Transportation Science, 1984
• Linear-time computability of combinatorial problems on series-parallel graphs
  Journal of the ACM, 1982
• Computation of the center and diameter of outerplanar graphs
  Discrete Applied Mathematics, 1980
• The complexity of the network design problem
  Networks, 1978
• Graph Theory with Applications
  Published by Springer Nature ,1976
• Optimum Communication Spanning Trees
  SIAM Journal on Computing, 1974
• Optimal Network Problem: A Branch-and-Bound Algorithm
  Environment and Planning A: Economy and Space, 1973
• The optimal network problem: Some computational procedures
  Transportation Research, 1969
• Topology of series-parallel networks
  Journal of Mathematical Analysis and Applications, 1965
• Multi-Terminal Network Flows
  Journal of the Society for Industrial and Applied Mathematics, 1961