Mathematical programming models for some smallest-world problems
From MaRDI portal
Recommendations
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- scientific article; zbMATH DE number 91018
- scientific article; zbMATH DE number 731844
- On the connectivity and diameter of small-world networks
- On the maximum small-world subgraph problem
Cites work
- scientific article; zbMATH DE number 1963107 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Augmenting trees to meet biconnectivity and diameter constraints
- Collective dynamics of `small-world' networks
- Deterministic small-world networks
- Diameter increase caused by edge deletion
- Emergence of Scaling in Random Networks
- Exploring complex networks
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- The small-world phenomenon: an algorithmic perspective
- Unravelling small world networks
Cited in
(1)
This page was built for publication: Mathematical programming models for some smallest-world problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572112)