Pages that link to "Item:Q5326889"
From MaRDI portal
The following pages link to Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889):
Displaying 9 items.
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
