On optimization of complete social networks

DOI10.1134/S199508021901013XMaRDI QIDQ2003111zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

graph algorithmsbalanced signed graphs

Mathematics Subject Classification ID

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

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

Cites work

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

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)