Sometimes social networks frequently require multiple distinct types of connectivity information which can finally be derived as layers. This type of information retrieval can be represented as multi-layer graphs, where each layer contains a set of edges over the same underlying nodes of the base layer. The author proposes two algorithms namely MulCaDu and SoGraM. The first algorithm, MulCaDu represents a call-duration telephone graph as a multi-layer graph. So a total of four layers are generated namely base layer, sublayer-1 (low-call), sublayer-2 (medium-call), and sublayer-3 (high-call) respectively. The second algorithm, SoGraM represents a social graph as a multi-layer graph. For this, the author has chosen three examples of social graph namely Author Graph, Email Graph, and Telephone Graph. So, the Algorithm, SoGraM has successfully represented the Author Graph, Email Graph, and Telephone Graph as multi-layer graphs with three layers, four layers, and five layers respectively.
B. Rao is currently working as Asst. Professor in the Dept. of CSEA at IGIT, Sarang, Odisha, India. He is pursuing Ph.D.(CSE) from BPUT, Rourkela, Odisha, India. He has received M.Tech (CS) from Berhampur University, Berhampur, Odisha, India. His current research areas are Graph Mining, Data Mining, Text Mining, Attributed and Multi-Layer Graphs.
Number of Pages:
LAP LAMBERT Academic Publishing
multi-layer graph, directed weighted graph, Weight, base layer, social graph, author graph, email graph, sub layer, telephone graph
COMPUTERS / Networking / General