Algorithm of splitting telecom society network based on maximal connected subgraph
Guohe Li · Computer Engineering and Applications Journal · 2008
With the development of telecommunications,analysis of telecom society network rises gradually.According to the characteristics of telecom data,an algorithm(MCSG) of searching maximal connected subgraph was proposed based on relational database.This algorithm realized hierachical processing of graph data with concept of equivalent class.Maximal connected subgraph was expressed with edge identifier pattern,thus,the information integrity of vertices and edges can be insured.From experiment results,algorithm MCSG realized splitting telecom society network effectively.