Comparison of methods for the detection of node group membership in bipartite networks

DOI10.1140/EPJB/E2009-00397-6zbMath1189.05165OpenAlexW2030715637WikidataQ57828381 ScholiaQ57828381MaRDI QIDQ978943

J. Martínez

Publication date: 25 June 2010

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1140/epjb/e2009-00397-6

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Модель эволюции распределений степеней вершин графов социальных сетей ⋮ Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure ⋮ Towards quantum computing based community detection

Cites Work

• From the Cover: The structure of scientific collaboration networks
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles

This page was built for publication: Comparison of methods for the detection of node group membership in bipartite networks