Diameters of weighted double loop networks

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

Ying Cheng, Frank K. Hwang

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 graphextremal problemmaximum weighted distanceweighted diameterweighted double loop network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Linear Diophantine equations (11D04)

Related Items

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

This page was built for publication: Diameters of weighted double loop networks