Relaxing the strong triadic closure problem for edge strength inference

DOI10.1007/s10618-020-00673-0zbMath1433.68273arXiv1802.03549OpenAlexW2999177578WikidataQ126332637 ScholiaQ126332637MaRDI QIDQ1987174

Tijl De Bie, Polina Rozenshtein, Antonis Matakos, Florian Adriaens, Aristides Gionis, Jefrey Lijffijt

Publication date: 9 April 2020

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

Full work available at URL: https://arxiv.org/abs/1802.03549

zbMATH Keywords

linear programmingconvex relaxationsstrong triadic closurehalf-integralitystrength of social ties

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Strengthening ties towards a highly-connected world

Uses Software

• SNAP
• CVX
• Mosek
• node2vec
• RolX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient bounds for the stable set, vertex cover and set packing problems
• Testing the necklace condition for shortest tours and optimal factors in the plane
• Finding an interior point in the optimal face of linear programs
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Transforming Graph Data for Statistical Relational Learning
• Smoothed analysis of algorithms
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Vertex packings: Structural properties and algorithms
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

This page was built for publication: Relaxing the strong triadic closure problem for edge strength inference