M
Q. ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
Related MCQs
Q. A relation that has no partial dependencies is in which normal form
Q. Berge graph is similar to due to strong perfect graph theorem.
Q. State the stage at which the preventive control takes place.
Q. automatically identifying a Web user's location
Discusssion
Login to discuss.