Learning Attack Strategies from Intrusion Alerts ∗ Peng Ning

First Page		Document Content
Date: 2011-11-09 13:26:02 NP-complete problems Morphisms Alert correlation Graph isomorphism Subgraph isomorphism problem Matching Tree Mathematics Theoretical computer science Graph theory		Learning Attack Strategies from Intrusion Alerts ∗ Peng Ning Add to Reading List Source URL: discovery.csc.ncsu.edu Download Document from Source Website File Size: 173,93 KB Share Document on Facebook

	3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen DocID: 1vjcF - View Document
	Chapter 68 Graph Isomorphism Testing without Numerics for Graphs of Bounded Eigenvalue Multiplicity DocID: 1ugIx - View Document
	Graph Isomorphism in Quasipolynomial Time L´aszl´o Babai University of Chicago arXiv:1512.03547v1 [cs.DS] 11 Dec 2015 DocID: 1syEg - View Document
	Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is DocID: 1rkqP - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document