𝔖 Bobbio Scriptorium
✦   LIBER   ✦

From a simple elimination ordering to a strong elimination ordering in linear time

✍ Scribed by J. Sawada; J.P. Spinrad


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
81 KB
Volume
86
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis


We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a strong elimination ordering.


πŸ“œ SIMILAR VOLUMES


Bifurcation in a time-optimal problem fo
✍ S.A. Reshmin πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 277 KB

A time-optimal problem for a second-order non-linear system with one degree of freedom is considered. The system describes the dynamics of an inertial object under the action of a control force of limited modulus which appears linearly and a perturbing force which is periodic in coordinate. The term

Higher order effects in non-linear evolu
✍ G. Chachamis; M. Lublinsky; A. Sabio Vera πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 207 KB

Higher order corrections to the Balitsky-Kovchegov equation have been estimated by introducing a rapidity veto which forbids subsequent emissions to be very close in rapidity and is known to mimic higher order corrections to the linear BFKL equation. The rapidity veto constraint has been first intro