Community Search over Big Graphs

DOI10.2200/S00928ED1V01Y201906DTM061zbMath1420.68002OpenAlexW4211169459WikidataQ127393619 ScholiaQ127393619MaRDI QIDQ5232273

Xin Huang, Laks V. S. Lakshmanan, Jianliang Xu

Publication date: 30 August 2019

Published in: Synthesis Lectures on Data Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2200/s00928ed1v01y201906dtm061

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Effective and efficient community search with size constraint on bipartite graphs ⋮ Finding influential communities in networks with multiple influence types

This page was built for publication: Community Search over Big Graphs