✦ LIBER ✦

Efficient and Practical Algorithms for Sequential Modular Decomposition

✍ Scribed by Elias Dahlhaus; Jens Gustedt; Ross M McConnell

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 214 KB
Volume: 41
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.2001.1185

No coin nor oath required. For personal study only.

✦ Synopsis

A module of an undirected graph G = V E is a set X of vertices that have the same set of neighbors in V \X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O n + mα m n time bound and a variant with a linear time bound.

📜 SIMILAR VOLUMES

An Algorithm for the Modular Decompositi

An Algorithm for the Modular Decomposition of Hypergraphs

✍ Paola Bonizzoni; Gianluca Della Vedova 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We propose an O n algorithm to build the modular decomposition tree of hypergraphs of dimension three and show how this algorithm can be generalized to time the decomposition of hypergraphs of any fixed dimension k.

Efficient Sequential and Parallel Algori

Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

✍ D. Pearson; V.V. Vazirani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 344 KB

A maximal bipartite set (MBS) in an undirected graph \(G=(V, E)\) is a maximal collection of vertices \(B \subseteq V\) whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS. 1.1993 Acatemic Press, Inc

An efficient algorithm for optimum decom

An efficient algorithm for optimum decomposition of recycle systems

✍ Ravindra S. Upadhye; Edward A. Grens II 📂 Article 📅 1972 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 769 KB

Robust domain decomposition algorithms f

Robust domain decomposition algorithms for multiscale PDEs

✍ I.G. Graham; R. Scheichl 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

## Abstract In this article, we describe a new class of domain decomposition preconditioners suitable for solving elliptic PDEs in highly fractured or heterogeneous media, such as arise in groundwater flow or oil recovery applications. Our methods employ novel coarsening operators, which are adapte

S-NNLS: An efficient non-negative least

S-NNLS: An efficient non-negative least squares algorithm for sequential data

✍ Giuseppe Bombara; Marco Cococcioni; Beatrice Lazzerini; Francesco Marcelloni 📂 Article 📅 2011 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 228 KB

Overlapping Domain Decomposition Algorit

Overlapping Domain Decomposition Algorithms for General Sparse Matrices

✍ Xiao-Chuan Cai; Yousef Saad 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 856 KB

Domain decomposition methods for finite element problems using a partition based on the underlying finite element mesh have been extensively studied. In this paper, we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices. The subproblem