Strengthening ties towards a highly-connected world
From MaRDI portal
(Redirected from Publication:832669)
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- Computational methods in decision-making, economics and finance
- Densest \(k\)-subgraph approximation on intersection graphs
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Edge modification criteria for enhancing the communicability of digraphs
- Elimination Graphs
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- Minimizing the diameter of a network using shortcut edges
- Networks, crowds and markets. Reasoning about a highly connected world.
- Relaxing the strong triadic closure problem for edge strength inference
Cited in
(2)
This page was built for publication: Strengthening ties towards a highly-connected world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832669)