𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the length of the longest increasing run in Rd

✍ Scribed by Andrei N. Frolov; Alexander I. Martikainen

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
407 KB
Volume
41
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the length of longest dominating cycl
On the length of longest dominating cycles in graphs
✍ Hoa Vu Dinh πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length

On the tail probability of the longest w
On the tail probability of the longest well-matching run
✍ C.J. Chang; C.S.J. Fann; W.C. Chou; I.B. Lian πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 198 KB

The distribution of the length of the longest run has wide applications in regard to reliability and DNA sequencing. Statistical tests based on the longest well-matching run are usually considered to be more reasonable than tests based on the perfect-matching run. In this paper, a method adopted fro

An algorithm for the determination of a
An algorithm for the determination of a longest increasing subsequence in a sequence
✍ M. Orlowski; M. Pachter πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 171 KB

We present a simple, novel and efficient algorithm for the determination of a longest increasing subsequence in a given sequence of ,, numbers. Our algorithm performs in O(,~ log r) time in the worst case, where r is the size of the output, i.e. r is the length of the longest increasing subsequence