论文信息 - Smallest Augmentations to Biconnect a Graph

Smallest Augmentations to Biconnect a Graph

We provide an $O(| V | + | E |)$ algorithm which, given a graph G, finds a smallest set of edges which, when added to G, produces a graph with no cutpoints.

Arnie Rosenthal | Anita Goldner | A. Rosenthal | Anita Goldner

[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[2] Robert E. Tarjan,et al. Augmentation Problems , 1976, SIAM J. Comput..

[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[4] Frank Harary,et al. Graph Theory , 2016 .