Top-\(k\) overlapping densest subgraphs

DOI10.1007/s10618-016-0464-zzbMath1411.68101OpenAlexW2398413754MaRDI QIDQ1741274

Nikolaj Tatti, Aristides Gionis, Esther Galbrun

Publication date: 3 May 2019

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

Full work available at URL: https://doi.org/10.1007/s10618-016-0464-z

zbMATH Keywords

approximation algorithmcommunity detectionsocial network analysisoverlapping communitiesdense subgraphsdiverse subgraphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Density (toughness, etc.) (05C42)

Related Items (6)

Finding dense subgraphs with maximum weighted triangle density ⋮ Covering a graph with densest subgraphs ⋮ OCSM: finding overlapping cohesive subgraphs with minimum degree ⋮ Dense Subgraphs in Biological Networks ⋮ Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity ⋮ Computing the \(k\) densest subgraphs of a graph

Uses Software

• MotifCut

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Finding Dense Subgraphs with Size Bounds
• On Finding Dense Subgraphs
• An analysis of approximations for maximizing submodular set functions—I
• Community structure in social and biological networks
• Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
• Greedily Finding a Dense Subgraph
• Finding overlapping communities in networks by label propagation
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Overlapping community detection in networks
• The dense \(k\)-subgraph problem

This page was built for publication: Top-\(k\) overlapping densest subgraphs