Biconnected components

From Algowiki

Revision as of 14:17, 30 October 2014 by Weihe (talk | contribs) (→‎Input)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Input

A connected undirected graph [math]\displaystyle{ G=(V,E) }[/math].

Output

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

Known algorithms

Hopcroft-Tarjan

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Biconnected_components&oldid=1656"