𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding all the palindromes in a binary tree in linear time and space

✍ Scribed by Bettina De Iaco; Fabrizio Luccio

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
457 KB
Volume
44
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear-time algorithm for broadcast do
A linear-time algorithm for broadcast domination in a tree
✍ John Dabney; Brian C. Dean; Stephen T. Hedetniemi πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

## Abstract The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power __p__ at vertex __v__ is capable of dominating (broadcasting to) all vertices within distance __p__ from __v__. Our goal is to assign a broadcast power __f__(__v

Positivity and time behavior of a linear
Positivity and time behavior of a linear reaction–diffusion system, non-local in space and time
✍ Andrii Khrabustovskyi; Holger Stephan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 330 KB

## Abstract We consider a general linear reaction–diffusion system in three dimensions and time, containing diffusion (local interaction), jumps (nonlocal interaction) and memory effects. We prove a maximum principle and positivity of the solution and investigate its asymptotic behavior. Moreover,