McqMate

Q. |
## What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)? |

A. | o(n!) |

B. | o(n! * n) |

C. | o(log n) |

D. | o(n) |

Answer» B. o(n! * n) | |

Explanation: for a graph having n vertices traverse the permutations in n! iterations and it traverses the permutations to see if adjacent vertices are connected or not takes n iterations (i.e.) o(n! * n). |

3.9k

0

Do you find this helpful?

38

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
- For a graph of degree three, in what time can a Hamiltonian path be found?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
- The problem of finding a path in a graph that visits every vertex exactly once is called?