# Modular decomposition

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2009

Highly Cited

2009

- Front. Neuroinform.
- 2009

The idea that complex systems have a hierarchical modular organization originated in the early 1960s and has recently attractedâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- ICALP
- 2008

Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientationâ€¦Â (More)

Is this relevant?

2007

2007

- Theory of Computing Systems
- 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)

Is this relevant?

2005

2005

- Discrete Applied Mathematics
- 2005

Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are e cientâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Discrete Mathematics
- 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

- Nature
- 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

- SODA
- 1997

We give a simple recursive algorithm for modular decomposition of undirected graphs that runs in O(n + ma(m,n)) time. Previousâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- CAAP
- 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

- SODA
- 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

- J. ACM
- 1989

Modular decomposition is a form of graph decomposition that has been discovered independently by researchers in graph theoryâ€¦Â (More)

Is this relevant?