Please subscribe to the official Codeforces channel in Telegram via the link: ×

vamaddur's blog

By vamaddur, history, 14 months ago, In English,

Given an undirected connected graph, what is the minimum number of edges that must be added to it to make it 2-vertex-connected, and what are those edges?

Is the methodology for this problem similar to the same situation of making a graph 2-edge-connected (adding ceil(numPendants/2) edges)?

Please help, and thanks in advance!

  • Vote: I like it  
  • +3
  • Vote: I do not like it  

14 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by vamaddur (previous revision, new revision, compare).