An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
From MaRDI portal
Publication:3338283
DOI10.1002/net.3230140106zbMath0547.05039OpenAlexW2085406987MaRDI QIDQ3338283
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140106
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items
Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II, Large fault-tolerant interconnection networks, Robustness and Strong Attack Tolerance of Low-Diameter Networks, A bootstrap heuristic for designing minimum cost survivable networks, Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter, Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks, Graph theory (algorithmic, algebraic, and metric problems)
Cites Work