Diameters of weighted double loop networks

DOI10.1016/0196-6774(88)90030-2zbMath0648.05030MaRDI QIDQ3792709

Frank K. Hwang, Ying Cheng

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90030-2

zbMATH Keywords

directed graph; extremal problem; maximum weighted distance; weighted diameter; weighted double loop network

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C20: Directed graphs (digraphs), tournaments

11D04: Linear Diophantine equations

Related Items

A complementary survey on double-loop networks, A symbolical algorithm on additive basis and double-loop networks, Double commutative-step digraphs with minimum diameters, Numerical semigroups: Apéry sets and Hilbert series., Improved upper and lower bounds on the optimization of mixed chordal ring networks, Optimal routing in double loop networks, Triple-loop networks with arbitrarily many minimum distance diagrams, New dense families of triple loop networks, Triple loop networks with small transmission delay, The obnoxious center problem on weighted cactus graphs., A simple algorithm to find the steps of double-loop networks, An efficient algorithm to find optimal double loop networks, A survey on multi-loop networks., Weighted multi-connected loop networks, An efficient algorithm to find a double-loop network that realizes a given L-shape, Reliabilities of Double-Loop Networks, Some contributions to the Frobenius' Problem, Sets of Gaps in Sequences of Frobenius' Problems with 3 Elements, Diameters and Eigenvalues