𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved lower bounds on the length of Davenport-Schinzel sequences

✍ Scribed by Micha Sharir

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
421 KB
Volume
8
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds on lengths of checking sequ
Lower bounds on lengths of checking sequences
✍ Guy-Vincent Jourdan; Hasan Ural; HΓΌsnΓΌ YenigΓΌn; Ji Chao Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 191 KB
Lower bounds on the lengths of node sequ
Lower bounds on the lengths of node sequences in directed graphs
✍ George Markowsky; Robert Endre Tarjan πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 353 KB

A strong node sequence for a directed graph G = (N, A) is a sequence of nodes containing every cycle-free path of G as a subsequence. A weak node sequence for G is a sequence of nodes containing every basic path in G as a subsequence, where a basic path nt, n~ ..... nj, is a path from Ilt to nk such