Can I read Scaffold permutations on EtoBox?

Scaffold permutations by P. Rosenstiehl is a Computer Science article available to read on EtoBox.

What is Scaffold permutations about?

The so-called in-order of the vertices of a binary tree T, as used in the data structure literature, is defined by the rule that each vertex follows all vertices of its left subtree, and precedes all those of its right subtree. Now, label the n vertices of T from 1 to n according to the shelling order, the root being labelled 1, the vertices at the same level being labelled consecutively from left to right, and among two levels the one closer to the root being labelled first. The permutation defined by taking the labels in the in-order of the vertices of T is called a scaffold permutation. The scaffold permutations on [l, n] are shown to form a code for the set of unlabelled binary trees with n vertices. The generalization of the scaffold property to bipermutations on [l, n] generates a code for the set of rooted maximal planar maps with II + 3 vertices. Scaffold permutations and bipermutations afford some special features in the computation of their table of inversion, which is relevant to the Fraysseix-Pollack algorithm for embedding a planar map in the grid.

Who reads Scaffold permutations?

Author

P. Rosenstiehl

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)

Published

1989

Language

CY

Field

Computer Science (Physical Sciences)