𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs

✍ Scribed by Bergeron, Anne; Chauve, Cedric; de Montgolfier, Fabien; Raffinot, Mathieu

Book ID
118196929
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
218 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Application of Domain Decomposition
The Application of Domain Decomposition to Time-Domain Computations of Nonlinear Water Waves with a Panel Method
✍ P.C.A. De Haas; P.J. Zandbergen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 364 KB

Nevertheless, at present there is still a need to reduce the computational costs of a BEM. Moreover, the straight-In this paper an iterative domain decomposition method for the solution of Laplace's equation is described and its effectiveness in forward application of a BEM requires a computational

Computation of the NPMLE of distribution
Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model
✍ Wei Pan; Rick Chappell πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 1008 KB

The iterative convex minorant (ICM) algorithm (Groeneboom and Wellner, 1992) is widely believed to be much faster than the EM algorithm (Turnbull, 1976) in computing the NPMLE of the distribution function for interval censored data. Our formulation of the ICM helps to explore its connection with the