Minimum Number of Edges To Add to Make a Graph 2-Vertex-Connected

Правка en1, от vamaddur, 2017-10-17 03:21:51

Given a connected, undirected 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!

Теги biconnected-components

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский vamaddur 2017-10-21 16:26:59 16 Tiny change: 'Given a connected, undirected grap' -> 'Given an undirected connected grap'
en1 Английский vamaddur 2017-10-17 03:21:51 399 Initial revision (published)