Detecting communities under constraints in directed acyclic networks

MaRDI QIDQ5049865zbMATH OpenFDO

Authors Suzana Antunović, Damir Vukičević

Publication date 14 November 2022

Full work available at URL http://www.math.nthu.edu.tw/~amen/2021/AMEN-200819.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Recommendations

• Community structure detection for directed networks through modularity optimisation
• A constrained power method for community detection in complex networks
• Detecting network communities: a new systematic and efficient algorithm
• Toward optimal community detection: from trees to general weighted networks
• Modularity density of network community divisions

Cites work

• scientific article; zbMATH DE number 2111136 (Why is no real title available?)
• Community structure in social and biological networks
• Networks. An introduction.
• Probabilistic Boolean networks. The modeling and control of gene regulatory networks
• The Structure and Function of Complex Networks

Describes a project that uses

Uses Software

• Stony Brook

This page was built for publication: Detecting communities under constraints in directed acyclic networks

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