Cs 6515 - Study guides, Class notes & Summaries

In a DAG, what makes a pair of vertices strongly connected? - answer-There is a path `V→W` and `W→V` Conservation of flow - answer-The flow into a vertex V must me equal to the flow out of the vertex V What problems are in the class NP-Hard? - answer-Any problem to which any problem in NP can be reduced to What problems are in the class NP? - answer-Any problems that can have their solutions verified in polynomial time, but can not be solved in polynomial time What problems are in th...

CS 6515 GA  HW 4. Due: 2/11/2019 Name: 1 Problem 1 [DPV] Problem 3.15 (Computopia) Part (a): Solution: We will represent the city in this problem as a directed graph G = (V; E). The vertices in V represent the intersections in the city, and the directed edges in E represent the streets of the city. Then, the problem is to determine whether a path from u to v exists for all u; v 2 V , and to do so in linear time. We can solve this problem using the SCC algorithm. If the entire graph G is...