Description
Problem 1: Prove that if we can solve the r-Vertex Disjoint Paths problem in polynomial time then we
can determine if G contains another graph H as a minor in polynomial time.
CSDS 455: Applied Graph Theory Homework 22
$35.00
Download Details:
- Name: homework_22-9wbopn.zip
- Type: zip
- Size: 144.96 KB
