Strengthening ties towards a highly-connected world

DOI10.1007/S10618-021-00812-1zbMATH Open1497.91241OpenAlexW4206265813MaRDI QIDQ832669FDOQ832669

Authors: Antonis Matakos, Aristides Gionis 

Publication date: 25 March 2022

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-021-00812-1

Recommendations

• scientific article; zbMATH DE number 1331947
• scientific article; zbMATH DE number 1254464
• scientific article; zbMATH DE number 1262817

zbMATH Keywords

densest subgraph discoverylink recommendationsSTCstrong triadic closure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Cites Work

• Networks, crowds and markets. Reasoning about a highly connected world.
• Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
• Densest \(k\)-subgraph approximation on intersection graphs
• A Fast Parametric Maximum Flow Algorithm and Applications
• Elimination Graphs
• Minimizing the diameter of a network using shortcut edges
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition
• Computational methods in decision-making, economics and finance
• Relaxing the strong triadic closure problem for edge strength inference
• Edge modification criteria for enhancing the communicability of digraphs

Cited In (2)

• Relaxing the strong triadic closure problem for edge strength inference
• Stronger trust and privacy in social networks via local cooperation

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)