A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Overview of attention for article published in Algorithmica, June 1992

Altmetric Badge

About this Attention Score

In the top 25% of all research outputs scored by Altmetric
Good Attention Score compared to outputs of the same age (74th percentile)
High Attention Score compared to outputs of the same age and source (80th percentile)

Mentioned by

patent: 2 patents

q&a: 1 Q&A thread

Citations

dimensions_citation: 244 Dimensions

Readers on

mendeley: 29 Mendeley

Summary Patents Q&A Dimensions citations

So far, Altmetric has seen 1 Q&A post.

Are there nice generalizations of SPQR trees to k-connected components for k>3?

Posted by Jeff Burdges, at cstheory.stackexchange.com, 16 Oct 2011

I'm curious how one should best understand the connections between the k-connected components when $G$ has minimum cuts of size …