Smallest Augmentations to Biconnect a Graph

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1977 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 6, pages 55-66 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Arnie Rosenthal; Anita Goldner;

doi: 10.1137/0206003

Smallest Augmentations to Biconnect a Graph

- Summary
- Subjects
- Metrics

Abstract

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.

Keywords

Graph theory, Algorithms in computer science

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	51
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average