On optimization of complete social networks

DOI10.1134/S199508021901013XzbMATH Open1418.91433OpenAlexW2936011827WikidataQ128119241 ScholiaQ128119241MaRDI QIDQ2003111FDOQ2003111

Authors: A. T. Weldegebriel, B. Y. Stodolsky 

Publication date: 15 July 2019

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199508021901013x

Recommendations

• Approximation algorithms for balancing signed graphs
• Who should be my friends? Social balance from the perspective of game theory
• On the maximum locally clustered subgraph and some related problems
• Social balance on networks: the dynamics of friendship and enmity
• Measuring partial balance in signed networks

zbMATH Keywords

graph algorithmsbalanced signed graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Cites Work

• Signed graphs
• The line index and minimum cut of weighted graphs
• A Dynamic Programming Algorithm To Test A Signed Graph For Balance

Cited In (3)

• On the maximum locally clustered subgraph and some related problems
• Who should be my friends? Social balance from the perspective of game theory
• Vertex-Pursuit in Hierarchical Social Networks

This page was built for publication: On optimization of complete social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003111)