Biconnected components

From Algowiki
Revision as of 12:04, 30 October 2014 by Weihe (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Biconnected_components&oldid=1650"