Community detection in hypernetwork via density-ordered tree partition

DOI10.1016/J.AMC.2015.12.039zbMath1410.68289OpenAlexW2230371868MaRDI QIDQ671039

Qing Cheng, Jincai Huang, Zhong Liu, Guangquan Cheng

Publication date: 20 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.12.039

zbMATH Keywords

community detectionanomaly detectiondensity-ordered treevisual inspection

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Traveling salesman problems with PageRank distance on complex networks reveal community structure ⋮ Dynamic evolution of shipping network based on hypergraph ⋮ Study on information transmission model of enterprise informal organizations based on the hypernetwork

Cites Work

• Unnamed Item
• Predicting missing links via local information
• Networks of networks -- an introduction
• Detecting communities in \(K\)-partite \(K\)-uniform (hyper)networks
• Modelling systems by hypergraphs

This page was built for publication: Community detection in hypernetwork via density-ordered tree partition