OCSM: finding overlapping cohesive subgraphs with minimum degree

DOI10.1016/j.ins.2022.06.020arXiv2202.03255OpenAlexW4221156616WikidataQ114167329 ScholiaQ114167329MaRDI QIDQ6195198

Jung-Eun Kim, Junghoon Kim, Sungsu Lim

Publication date: 13 March 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.03255

zbMATH Keywords

minimum degreesocial network analysiscohesive subgraph discovery

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Finding weighted \(k\)-truss communities in large networks
• Top-\(k\) overlapping densest subgraphs
• Fast algorithms for determining (generalized) core groups in social networks
• Efficient temporal core maintenance of massive graphs
• Finding dense subgraphs with maximum weighted triangle density
• Defining and Discovering Communities in Social Networks
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem
• The dense \(k\)-subgraph problem

This page was built for publication: OCSM: finding overlapping cohesive subgraphs with minimum degree