On detecting maximal quasi antagonistic communities in signed graphs

DOI10.1007/s10618-015-0405-2zbMath1411.68102OpenAlexW2095264893MaRDI QIDQ1741135

Philips Kokoh Prasetyo, Ee-Peng Lim, Ming Gao, David Lo

Publication date: 3 May 2019

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

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/2858

zbMATH Keywords

signed graphpower law distributionenumeration treebi-cliquequasi antagonistic community

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Signed and weighted graphs (05C22)

Uses Software

• GenLouvain

Cites Work

• Unnamed Item
• Correlation clustering
• \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
• On generating all maximal independent sets
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Detecting network communities: a new systematic and efficient algorithm
• Quasi-bicliques: Complexity and Binding Pairs
• Graph theoretic blockings k‐plexes and k‐cutpoints
• A graph‐theoretic definition of a sociometric clique†
• Biclique graphs and biclique matrices
• Fast unfolding of communities in large networks
• Depth-First Search and Linear Graph Algorithms
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs