{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

assignment5 - {h G i| G contains a triangle 3 Call graphs G...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC544 Assignment #5 due Thursday 4/21 in class version 1.0 Problems 1. Show that the complexity classes P and NP are closed under concatena- tion and union. 2. A triangle in an undirected graph is a 3-clique. Show that T RIANGLE P , where T RIANGLE
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: {h G i| G contains a triangle } . 3. Call graphs G and H isomorphic if the nodes of G may be reordered so that it is identical to H . Show that ISO ∈ NP , where ISO = {h G,H i| G and H are isomorphic graphs } . 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online