Related references
Note: Only part of the references are listed.Modeling Influence Diffusion over Signed Social Networks
Dong Li et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2021)
A survey of community search over big graphs
Yixiang Fang et al.
VLDB JOURNAL (2020)
Searching for polarization in signed graphs: a local spectral approach
Han Xiao et al.
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020) (2020)
Finding large balanced subgraphs in signed networks
Bruno Ordozgoiti et al.
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020) (2020)
Efficient Maximal Balanced Clique Enumeration in Signed Networks
Zi Chen et al.
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020) (2020)
The k-core as a predictor of structural collapse in mutualistic ecosystems
Flaviano Morone et al.
NATURE PHYSICS (2019)
Discovering Polarized Communities in Signed Networks
Francesco Bonchi et al.
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19) (2019)
Efficient Signed Clique Search in Signed Networks
Rong-Hua Li et al.
2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE) (2018)
A Fast Order-Based Approach for Core Maintenance
Yikai Zhang et al.
2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017) (2017)
A Survey of Signed Network Mining in Social Media
Jiliang Tang et al.
ACM COMPUTING SURVEYS (2016)
The maximum balanced subgraph of a signed graph: Applications and solution approaches
Rosa Figueiredo et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
Finding Maximal Cliques in Massive Networks
James Cheng et al.
ACM TRANSACTIONS ON DATABASE SYSTEMS (2011)
Main-memory triangle computations for very large (sparse (power-law)) graphs
Matthieu Latapy
THEORETICAL COMPUTER SCIENCE (2008)