Lecture12-1_Part7 - is connected to a marked node, mark it...

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

View Full Document Right Arrow Icon
M= “On input , the encoding of a graph G : 1. Select a node of G and mark it. 2. Repeat until no new nodes are marked: 3. For every node of G , v , if v
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: is connected to a marked node, mark it as connected. 4. If all nodes are marked accept otherwise reject . Example: Connected Graphs 7 G...
View Full Document

This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.

Ask a homework question - tutors are online