Efficient and effective community search

DOI10.1007/s10618-015-0422-1zbMath1405.68235OpenAlexW776559747MaRDI QIDQ1715901

Edoardo Galimberti, Francesco Bonchi, Francesco Gullo, Nicola Barbieri

Publication date: 29 January 2019

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

Full work available at URL: https://doi.org/10.1007/s10618-015-0422-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

A community detection algorithm based on graph compression for large-scale social networks ⋮ An order approach for the core maintenance problem on edge-weighted graphs ⋮ Order based algorithms for the core maintenance problem on edge-weighted graphs ⋮ Effective and efficient community search with size constraint on bipartite graphs ⋮ Weighted clustering of attributed multi-graphs ⋮ Core Decomposition, Maintenance and Applications ⋮ Finding weighted \(k\)-truss communities in large networks

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• Fast algorithms for determining (generalized) core groups in social networks
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Efficient and effective community search