Strengthening ties towards a highly-connected world
type: Item
instance of: scholarly article
title: Strengthening ties towards a highly-connected world
zbMATH Open document ID: 1497.91241
author: Antonis Matakos
author: Aristides Gionis
published in: Data Mining and Knowledge Discovery
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7498467
zbMATH Keywords: strong triadic closure
zbMATH Keywords: STC
zbMATH Keywords: link recommendations
zbMATH Keywords: densest subgraph discovery
MaRDI profile type: Publication
full work available at URL: s10618-021-00812-1
OpenAlex ID: W4206265813
cites work: Relaxing the strong triadic closure problem for edge strength inference
cites work: Computational methods in decision-making, economics and finance
cites work: Edge modification criteria for enhancing the communicability of digraphs
cites work: Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
cites work: Densest k-Subgraph Approximation on Intersection Graphs
cites work: Minimizing the Diameter of a Network Using Shortcut Edges
cites work: Q4931752
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Minimizing Average Shortest Path Distances via Shortcut Edge Addition
cites work: Elimination Graphs
DOI: 10.1007/S10618-021-00812-1
Recommended article: Q4261750
Recommended article: Q4227536
Recommended article: Q4233898
description: scientific article; zbMATH DE number 7498467