The question reads: Give a formal encoding of directed graphs as binary stringsu

Question

The question reads: Give a formal encoding of directed graphs as binary stringsusing an adjacency matrix representation. Do the same using anadjacency-list representation. Argue that the two representationsare polynomially related.
I wish i had a more specific question, but the entire problemperplexes me. I might be able to prove that matrix can be convertedto list (and vice versa) in polynomial time if i knew how to encodegraphs into them as binary strings.
Help? Give a formal encoding of directed graphs as binary stringsusing an adjacency matrix representation. Do the same using anadjacency-list representation. Argue that the two representationsare polynomially related.
I wish i had a more specific question, but the entire problemperplexes me. I might be able to prove that matrix can be convertedto list (and vice versa) in polynomial time if i knew how to encodegraphs into them as binary strings.
Help?

Explanation / Answer

i know

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---