Discovering and balancing fundamental cycles in large signed graphs-Reference-Cited by-同舟云学术

Discovering and balancing fundamental cycles in large signed graphs

Published:2021-11-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
language:
Short-container-title:

Author:

Alabandi Ghadeer¹,Tešić Jelena¹,Rusnak Lucas¹,Burtscher Martin¹

Affiliation:

1. Texas State University

Funder

NSF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3458817.3476153

Reference45 articles.

1. Symbolic psycho-logic: A model of attitudinal cognition

2. Measuring Reputation and Influence in Online Social Networks: A Systematic Literature Review

3. Ghadeer Alabandi and Martin Burtscher. 2021. graphB+ code. https://cs.txstate.edu/~burtscher/research/graphBplus/. Ghadeer Alabandi and Martin Burtscher. 2021. graphB+ code. https://cs.txstate.edu/~burtscher/research/graphBplus/.

4. A dynamical approach to privacy preserving average consensus

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Correction to the Heuristic Algorithm MinimalFlipSet to Balance Unbalanced Graphs;Studies in Computational Intelligence;2024

2. Identifying Stable States of Large Signed Graphs;Companion Proceedings of the ACM Web Conference 2023;2023-04-30

3. A More Powerful Heuristic for Balancing an Unbalanced Graph;Complex Networks and Their Applications XI;2023

4. Advances in scaling community discovery methods for signed graph networks;Journal of Complex Networks;2022-04-25

5. Pattern of frustration formation in the functional brain network;Network Neuroscience;2022