How many steps are required to prove that a decision pr - Practice (English)

Loading practice questions

A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Practice library for exams, subjects, and daily revision. For learning purposes only.

How many steps are required to prove that a decision pr - Practice (English) | ObjectiveMcq

606 views

How many steps are required to prove that a decision problem is NP-complete?

Correct Answer: B — 2

Explanation:

Two steps: first, show the problem is in NP; second, prove that every NP problem is polynomially reducible to it.

How many constraints does flow have?
What is the running time of Dinic's blocking flow algorithm?
Who formulated the Maximum flow problem?
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
In what time can an augmenting path be found?
A simple acyclic path between source and sink which passes through only positive weighted edges is called?
Under what condition can a vertex combine and distribute flow in any manner?