# hw1(8) - CS 573: Graduate Algorithms, Fall 2010 Homework 1...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 573: Graduate Algorithms, Fall 2010 Homework 1 Due Friday, September 10, 2010 at 1pm Due Monday, September 13, 2010 at 5pm (in the homework drop boxes in the basement of Siebel) For this and all future homeworks, groups of up to three students may submit a single, common solution. Please neatly print (or typeset) the full name and NetID on each page of your submission. 1. Two graphs are said to be isomorphic if one can be transformed into the other just by relabeling the vertices. For example, the graphs shown below are isomorphic; the left graph can be transformed into the right graph by the relabeling ( 1,2,3,4,5,6,7 ) 7 ( c , g , b , e , a , f , d ) . 1 2 3 4 5 6 7 c g b e f a d Two isomorphic graphs. Consider the following related decision problems: G RAPHISOMORPHISM: Given two graphs G and H , determine whether G and H are isomorphic. E VENGRAPHISOMORPHISM: Given two graphs G and H , such that every vertex in G and H has even degree, determine whether G and H are isomorphic.are isomorphic....
View Full Document

## This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

### Page1 / 2

hw1(8) - CS 573: Graduate Algorithms, Fall 2010 Homework 1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online