
 [No title] (Site not responding. Last check: 20071107) 
  Partial Key to HW 4 \large{\bf {41.} (10)} \begin {description} \item [a.] Go through the adjacency matrix M, for each M[i,j]=1, add j to i's adjacency list. 
  Then, go through the adjacency list for each vertex i, if j is in the adjacency list of i, and i>j, set $M[i, k]=1$, $M[j, k]=1$, and $k+=1$. 
  \item [c.] Go through each column of the adjacency list, find i, j such that $M[i, k]=0$ and $M[j, k] =0$, the add i to j's adjacency list and j to i's adjacency list. 
 www.cs.sunysb.edu /~skiena/373/hw/key4.txt (811 words) 
