Strengthening ties towards a highly-connected world

DOI10.1007/s10618-021-00812-1zbMath1497.91241OpenAlexW4206265813MaRDI QIDQ832669

Aristides Gionis, Antonis Matakos

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

zbMATH Keywords

densest subgraph discoverylink recommendationsSTCstrong triadic closure

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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
• Detecting high log-densities
• Densest k-Subgraph Approximation on Intersection Graphs
• Minimizing the Diameter of a Network Using Shortcut Edges
• Elimination Graphs
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Strengthening ties towards a highly-connected world