Comparison of Communities Detection Algorithms for Multiplex
Abstract
Multiplex is a set of graphs on the same vertex set, i.e. \G(V,E1),…,G(V,Em)\. It is a generalized graph to model multiple relationships with parallel edges between vertices. This paper is a literature review of existing communities detection algorithms for multiplex and a comparative analysis of them.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.