40th Annual Hawaii International Conference on System Sciences (HICSS'07) Big Island, Hawaii January 03-January 06 ISBN: 0-7695-2755-8
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^4) running time for finding good cross associations.
Citation:
M.H. Heydari, L. Morales, C.O. Shields, Jr., I.H. Sudborough, "Computing Cross Associations for Attack Graphs and Other Applications," hicss, pp.270b, 40th Annual Hawaii International Conference on System Sciences (HICSS'07), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||