For Which Of The Following Greedy Algorithm Finds A Minimal #802
For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Intractable Problems - Node-Cover Problem and Hamilton Circuit Problem - Quiz No.1.
For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?
tree graphs
bipartite graphs
all of the mentioned
none of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
