Network decomposition for the optimization of connection structures

DOI10.1002/net.3230160209zbMath0642.90099OpenAlexW2079129721MaRDI QIDQ3783861

Agostino Villa, Oleg G. Taraszow, Enrico Canuto, Alfred Iwainsky

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230160209

zbMATH Keywords

designdecomposition techniques.connection structures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Proceedings, conferences, collections, etc. pertaining to general topology (54-06) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Conference proceedings and collections of articles (00Bxx)

Related Items (4)

On reductions for the Steiner problem in graphs ⋮ Compact location problems with budget and communication constraints ⋮ The decomposition of a communication network considering traffic demand interrelations ⋮ Heuristics for the Steiner problem in graphs

Cites Work

• Sparse matrix techniques for the shortest path problem
• Optimal Decomposition of Large-Scale Networks

This page was built for publication: Network decomposition for the optimization of connection structures