Modular decomposition

In graph theory, the modular decomposition is a decomposition of a graph into subsets of vertices called modules. A module is a generalization of a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
The idea that complex systems have a hierarchical modular organization originated in the early 1960s and has recently attracted… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation… (More)
Is this relevant?
2007
2007
A graph G is said to be a bicluster graph if G is a disjoint union of bicliques (complete bipartite subgraphs), and a cluster… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2005
2005
Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are e cient… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The principle of 'divide-and-conquer', the decomposition of a complex task into simpler subtasks each learned by a separate… (More)
Is this relevant?
1997
1997
We give a simple recursive algorithm for modular decomposition of undirected graphs that runs in O(n + ma(m,n)) time. Previous… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present here a new algorithm linear in time and space complexity for Modular Decomposition. This algorithm relies on… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A module of an undirected graph is a set X of nodes such for each node x not in X, either every member of X is adjacent to x , or… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Modular decomposition is a form of graph decomposition that has been discovered independently by researchers in graph theory… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?