Computing Cross Associations for Attack Graphs and Other Applications

Applications in information security, data mining, e-commerce, information retrieval and network management require the analysis of large graphs in order to discover homogeneous groupings of rows and columns, called cross associations. We show that finding an optimal cross association is NP-complete. Furthermore, we give a heuristic algorithm with an O(n⁴) running time for finding good cross associations