Giant component

From Wikipedia, the free encyclopedia

You have new messages (last change).

Giant component is a network theory term referring to a connected subgraph that contains a majority of the entire graph's nodes. Percolation theory is based on adding nodes and connections to an empty graph until a giant component surfaces.

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../g/i/a/Giant_component.html"