- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Who formulated a straight forward backtr...

Q. |
## Who formulated a straight forward backtracking scheme for stable marriage problem? |

A. | mcvitie and wilson |

B. | gale |

C. | ford and fulkerson |

D. | dinitz |

Answer» A. mcvitie and wilson | |

Explanation: mcvitie and wilson formulated a much faster straight forward backtracking scheme for stable marriage problem. ford and fulkerson formulated maximum flow problem. |

View all MCQs in:
Design and Analysis of Algorithms

- Stable marriage problem is an example of?
- Which of the following algorithms does Stable marriage problem uses?
- What is the prime task of the stable marriage problem?
- Which of the following problems is related to stable marriage problem?
- What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
- Can stable marriage cannot be solved using branch and bound algorithm.
- Who formulated the first ever algorithm for solving the Hamiltonian path problem?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
- Who formulated quick hull algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ