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

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 TRIANGLE P ,where TRIANGLE =
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

This note was uploaded on 10/03/2011 for the course CSC 544 taught by Professor Staff during the Spring '11 term at Rhode Island.

Ask a homework question - tutors are online