Biconnected components: Difference between revisions

From Algowiki
Jump to navigation Jump to search
(Created page with "== Input == An undirected graph <math>G=(V,E)</math>. == Output == A set of sets of nodes such that each set of nodes is...")
(No difference)

Revision as of 12:04, 30 October 2014

Input

An 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

  1. Hopcroft-Tarjan