Unifying Two Graph Decompositions with Modular Decomposition

15 years 10 months ago

Download www.ii.uib.no

We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures. We show that, under some axioms, a unique decomposition tree exists for umodules. Polynomial-time algorithms are provided for: non-trivial umodule test, maximal umodule computation, and decomposition tree computation when the tree exists. Our results unify many known decomposition like modular and bi-join decomposition of graphs, and a new decomposition of tournaments.

Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,

Real-time Traffic

Decomposition | Decomposition Tree | ISAAC 2007 | Unique Decomposition Tree |

claim paper

» The Modular Decomposition of Countable Graphs Constructions in Monadic SecondOrder Logic

» Algebraic Operations on PQ Trees and Modular Decomposition Trees

» Nonnegative graph embedding

» Linear structure of bipartite permutation graphs and the longest path problem

» The Refined Process Structure Tree

» Modular decomposition and transitive orientation

» A Simple LinearTime Modular Decomposition Algorithm for Graphs Using Order Extension

» Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ISAAC
Authors	Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier

Comments (0)

Sciweavers

Unifying Two Graph Decompositions with Modular Decomposition

Decomposition | Decomposition Tree | ISAAC 2007 | Unique Decomposition Tree |

Explore & Download

Productivity Tools

Sciweavers