Strengthening ties towards a highly-connected world

DOI10.1007/S10618-021-00812-1MaRDI QIDQ832669zbMATH OpenOpenAlexFDO

Authors Antonis Matakos, Aristides Gionis

Publication date 25 March 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

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

• 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)

• 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)