Efficient and effective community search

DOI10.1007/S10618-015-0422-1MaRDI QIDQ1715901zbMATH OpenOpenAlexFDO

Authors Nicola Barbieri, Francesco Bonchi, Edoardo Galimberti, Francesco Gullo

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

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

Recommendations

• Community search over big graphs
• Approaches to community search under complex conditions
• Finding weighted k-truss communities in large networks
• Fast algorithms for constrained graph density problems
• A general view on computing communities

Cites work

• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs
• Fast algorithms for determining (generalized) core groups in social networks
• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• Statistical comparisons of classifiers over multiple data sets

Cited in

(10)

• Weighted clustering of attributed multi-graphs
• 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
• Core decomposition, maintenance and applications
• Approaches to community search under complex conditions
• Community search over big graphs
• Effective and efficient community search with size constraint on bipartite graphs
• Algorithms and hardness results for the (k, )-cover problem
• Finding weighted k-truss communities in large networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1715901)