Important subgraph discovery using non-dominance criterion
Graph mining techniques have received a lot of attention to discover important subgraphs based on certain criteria. These techniques have become increasingly important due to the growing number of applications that rely on graph-based data. Some examples are: (i) microarray data analysis in bioinformatics, (ii) transportation network analysis, (iii) social network analysis. In this study, we propose a graph decomposition algorithm using the non-dominance criterion to identify important subgraphs based on two characteristics: edge connectivity and diameter. The propo