The decomposition of a communication network considering traffic demand interrelations

DOI10.1016/S0016-0032(96)00084-1zbMath0872.90037MaRDI QIDQ679227

L. F. Turner, Javier A. Barria

Publication date: 26 October 1997

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

zbMATH Keywords

decompositioncommunication networksaggregate areaslarge-scale data network

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

Asymptotic stability analysis and model reduction for spatially interconnected time-delay systems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Improved Min-Cut Algonthm for Partitioning VLSI Networks
• Multiple-way network partitioning
• Network decomposition for the optimization of connection structures
• An Efficient Heuristic Procedure for Partitioning Graphs
• Diakoptic and generalized hybrid analysis
• An efficient heuristic cluster algorithm for tearing large-scale networks
• Optimal Decomposition of Large-Scale Networks
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: The decomposition of a communication network considering traffic demand interrelations