Need some hint...
Difference between en1 and en2, changed 0 character(s)
Hi, can you give me a hint about this problem ??↵
↵
Given a graph with n vertices and m edges, find the minimum number of operations required to remove the graph completely↵
↵
in an operation you can do one of the following things:↵
↵
1- remove a vertex from the graph↵
↵
2- remove 2 vertices connecting to an edge↵
↵
$$n, m < 10^6$$ ↵
↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Sookhail 2020-09-19 14:36:42 17 Tiny change: '\nGiven a graph wit' -> '\nGiven a connected simple graph wit'
en2 English Sookhail 2020-09-19 14:32:43 0 (published)
en1 English Sookhail 2020-09-19 14:31:36 355 Initial revision (saved to drafts)