Exam (elaborations)
CS-6515 Algorithms latest already passed
- Course
- Institution
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 ...
[Show more]