Mathwieser, Corinna; Çela, Eranda Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty. (English) Zbl 07819299 Networks 83, No. 3, 587-604 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{C. Mathwieser} and \textit{E. Çela}, Networks 83, No. 3, 587--604 (2024; Zbl 07819299) Full Text: DOI arXiv OA License
Carrabs, Francesco; Cerulli, Raffaele; Laureana, Federica; Serra, Domenico; Sorgente, Carmine A genetic approach for the 2-edge-connected minimum branch vertices problem. (English) Zbl 07791136 Networks 82, No. 4, 301-317 (2023). MSC: 90Cxx PDFBibTeX XMLCite \textit{F. Carrabs} et al., Networks 82, No. 4, 301--317 (2023; Zbl 07791136) Full Text: DOI
Bessy, Stéphane; Lepelletier, Clément Optical index of fault tolerant routings in WDM networks. (English) Zbl 1200.90037 Networks 56, No. 2, 95-102 (2010). MSC: 90B18 05C85 05C90 68M10 94C12 PDFBibTeX XMLCite \textit{S. Bessy} and \textit{C. Lepelletier}, Networks 56, No. 2, 95--102 (2010; Zbl 1200.90037) Full Text: DOI Link
Dinneen, Michael J.; Pritchard, Geoffrey; Wilson, Mark C. Degree- and time-constrained broadcast networks. (English) Zbl 1027.90011 Networks 39, No. 3, 121-129 (2002). MSC: 90B18 68M20 05C90 PDFBibTeX XMLCite \textit{M. J. Dinneen} et al., Networks 39, No. 3, 121--129 (2002; Zbl 1027.90011) Full Text: DOI
Fraigniaud, Pierre; Peters, Joseph G. Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs. (English) Zbl 0993.94026 Networks 38, No. 3, 150-162 (2001). Reviewer: Wai Kai Chen (Chicago) MSC: 94C15 05C35 PDFBibTeX XMLCite \textit{P. Fraigniaud} and \textit{J. G. Peters}, Networks 38, No. 3, 150--162 (2001; Zbl 0993.94026) Full Text: DOI
Lam, Peter Che Bor; Liu, Guizhen; Li, Guojun; Shiu, Wai Chee Orthogonal \((g,f)\)-factorizations in networks. (English) Zbl 0974.05065 Networks 35, No. 4, 274-278 (2000). MSC: 05C70 90B18 05C85 PDFBibTeX XMLCite \textit{P. C. B. Lam} et al., Networks 35, No. 4, 274--278 (2000; Zbl 0974.05065) Full Text: DOI
Fremuth-Paeger, Christian; Jungnickel, Dieter Balanced network flows. I: A unifying framework for design and analysis of matching algorithms. (English) Zbl 0999.90005 Networks 33, No. 1, 1-28 (1999). Reviewer: Matthias Ehrgott (Auckland) MSC: 90B10 90C35 05C85 PDFBibTeX XMLCite \textit{C. Fremuth-Paeger} and \textit{D. Jungnickel}, Networks 33, No. 1, 1--28 (1999; Zbl 0999.90005) Full Text: DOI
Beauquier, Bruno All-to-all communication for some wavelength-routed all-optical networks. (English) Zbl 0940.90018 Networks 33, No. 3, 179-187 (1999). MSC: 90B15 PDFBibTeX XMLCite \textit{B. Beauquier}, Networks 33, No. 3, 179--187 (1999; Zbl 0940.90018) Full Text: DOI