Mar 13, 2006 · In this paper, a new general decomposition theory inspired from modular graph decomposition is presented.

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general ...

Homogeneity vs. Adjacency: Generalising Some. Graph Decomposition Algorithms ... to modular decomposition of graphs and 2-structures, and to other graph rela-.

Homogeneity vs. Adjacency: generalising some graph decomposition algorithms ... Abstract. In this paper, a new general decomposition theory inspired from modular ...

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general ...

Graph-Theoretic Concepts in Computer Science; Conference paper. Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. Conference paper.

In this paper we point out the use of the homogeneous decomposition of graphs for the purpose of triangulation. As a direct application we show how to compute ...

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms · 9 Citations · 24 References.

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general ...

Bibliographic details on Homogeneity vs. Adjacency: generalising some graph decomposition algorithms.