Optimum Communication Spanning Trees in Series-Parallel Networks

DOI10.1137/0214064zbMath0575.68071OpenAlexW2053989074MaRDI QIDQ3694714

Charles J. Colbourn, Ehab S. El-Mallah

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214064

zbMATH Keywords

network designseries-parallel graphstraffic requirements

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items

Network Resilience ⋮ A survey of very large-scale neighborhood search techniques