Biconnected components

From Algowiki
Revision as of 12:40, 31 October 2014 by Weihe (talk | contribs) (→‎Input)
Jump to navigation Jump to search

Input

An undirected graph [math]\displaystyle{ G=(V,E) }[/math], which must be connected. For ease of notation and without loss of generality, we assume that [math]\displaystyle{ G }[/math] is simple.

Output

A set of sets of nodes such that each set of nodes is exactly one biconnected component.

Known algorithms

  1. Hopcroft-Tarjan