Pages that link to "Item:Q3338283"
From MaRDI portal
The following pages link to An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (Q3338283):
Displayed 7 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)