The decomposition of a communication network considering traffic demand interrelations
From MaRDI portal
Publication:679227
DOI10.1016/S0016-0032(96)00084-1zbMATH Open0872.90037MaRDI QIDQ679227FDOQ679227
Authors: L. F. Turner, J. A. Barria 
Publication date: 26 October 1997
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Recommendations
- Multicommodity flow problems and decomposition in telecommunications networks
- Network decomposition in the many-sources regime
- scientific article; zbMATH DE number 4112358
- Designing communication networks to decompose network control problems
- Network decomposition for the optimization of connection structures
- Multicommodity network flow models and algorithms in telecommunications
- scientific article; zbMATH DE number 1822297
- Asymptotic analysis of congested communication networks.
- A decomposition algorithm for multi-terminal network flows
- Decomposition and aggregation in queueing networks
Cites Work
- Title not available (Why is that?)
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- Multiple-way network partitioning
- Title not available (Why is that?)
- An Improved Min-Cut Algonthm for Partitioning VLSI Networks
- Network decomposition for the optimization of connection structures
- Diakoptic and generalized hybrid analysis
- An efficient heuristic cluster algorithm for tearing large-scale networks
- Optimal Decomposition of Large-Scale Networks
Cited In (3)
Uses Software
This page was built for publication: The decomposition of a communication network considering traffic demand interrelations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679227)
