出典:Wikipedia
出典:『Wikipedia』 (2011/05/06 05:48 UTC 版)
In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can be a proper subset of another. Modules therefore lead to a recursive (hierarchical) decomposition of the graph, instead of just a partition. For each undirected graph, this decomposition is unique.