A linear-time algorithm for the feasibility of pebble motion on trees
type: Item
instance of: scholarly article
title: A linear-time algorithm for the feasibility of pebble motion on trees
zbMATH Open document ID: 0921.68090
DOI: 10.1007/PL00009259
published in: Algorithmica
publication date: 1999-03-30T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1271319
zbMATH Keywords: pebble motion problem on trees
zbMATH Keywords: memory management
zbMATH Keywords: robot motion planning
zbMATH Keywords: deflection routing
author: V. Auletta
author: Angelo Monti
author: P. Persiano
author: Mimmo Parente
MaRDI profile type: Publication
full work available at URL: pl00009259
OpenAlex ID: W2083721544
Recommended article: A linear time algorithm for the feasibility of pebble motion on trees
Recommended article: Optimal pebble motion on a tree
Recommended article: Q3197842
Recommended article: Q2753956
Recommended article: Pebbles and Branching Programs for Tree Evaluation
Recommended article: Q4941149
Recommended article: A linear-time algorithm for the generation of trees
Recommended article: Sandpile prediction on a tree in near linear time
Recommended article: Linear-time algorithms for tree root problems
Recommended article: Linear-Time Algorithms for Tree Root Problems
description: scientific article; zbMATH DE number 1271319