𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time and space algorithm to recognize interval orders

✍ Scribed by Philippe Baldy; Michel Morvan

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
372 KB
Volume
46
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear time algorithm to recognize cir
A linear time algorithm to recognize circular permutation graphs
✍ Sritharan, R. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea

A Higher-Order Compact Method in Space a
A Higher-Order Compact Method in Space and Time Based on Parallel Implementation of the Thomas Algorithm
✍ Alex Povitsky; Philip J. Morris πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 143 KB

In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs in a space-time domain. For such a numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta

A characteristic domain decomposition an
A characteristic domain decomposition and space–time local refinement method for first-order linear hyperbolic equations with interfaces
✍ Hong Wang; Mohamed Al-Lawatia; Robert C. Sharpley πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 445 KB πŸ‘ 2 views

We develop a characteristic-based domain decomposition and space-time local refinement method for firstorder linear hyperbolic equations. The method naturally incorporates various physical and numerical interfaces into its formulation and generates accurate numerical solutions even if large time-ste