It's UWAweek 49


This forum is provided to promote discussion amongst students enrolled in CITS3001 Algorithms, Agents and Artificial Intelligence.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 292 articles.
Currently 3 other people reading this forum.

 UWA week 31 (2nd semester, week 2) ↓
SVG not supported

Login to reply

10:06pm Thu 3rd Aug, Mehwish N.

In vertex cover you want to select vertices, that cover all the edges, this means if an edge is not adjacent to the selected vertex, it is not covered (provided, it has not already been covered by another selected vertex). In dominating set, you want to select vertices, that cover all adjacent vertices. e.g., for the following edge set (a,b), (b,c), (c,a), in vertex cover, if you select a, it will only cover (a,c) and (a,b). In order to cover (b,c), you need one more vertex. However, for the same graph for dominating set, selection of any one vertex is enough as the other two are adjacent to that vertex. I hope it is clear now.

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy