Mathematics, 20.08.2019 23:30, ringo12384
5. we say that a set of vertices a ⊆ v is a vertex cover if every edge of the graph is incident to a vertex in the cover (so a vertex cover covers the edges). since v itself is a vertex cover, every graph has a vertex cover. the interesting is about finding a minimal vertex cover, one that uses the fewest possible number of vertices.
a). suppose you had a matching of a graph. how can you use that to get a minimal vertex cover? will your method always work?
b.) suppose you had a minimal vertex cover for a graph. how can you use that to get a partial matching? will your method always work?
c). what is the relationship between the size of the minimal vertex cover and the size of the maximal partial matching in a graph?
Answers: 1
Other questions on the subject: Mathematics
Mathematics, 21.06.2019 18:30, nativebabydoll35
How do you solving the solution of each system using elimination?
Answers: 2
Mathematics, 21.06.2019 21:10, verdolaga2017me
What is the domain of the given function? {(3,-2), (6, 1), (-1, 4), (5,9), (-4, 0); o {x | x= -4,-1, 3, 5, 6} o {yl y = -2,0, 1,4,9} o {x|x = -4,-2, -1,0, 1, 3, 4, 5, 6, 9} o y y = 4,-2, -1, 0, 1, 3, 4, 5, 6, 9}
Answers: 1
Do you know the correct answer?
5. we say that a set of vertices a ⊆ v is a vertex cover if every edge of the graph is incident to a...
Questions in other subjects:
Mathematics, 12.02.2021 14:00
Mathematics, 12.02.2021 14:00
Mathematics, 12.02.2021 14:00
