Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-page book embedding of trees under vertex-neighborhood constraints |
scientific article |
Statements
Two-page book embedding of trees under vertex-neighborhood constraints (English)
0 references
10 August 1993
0 references
This paper shows that any tree has a two page embedding with the constraints that vertices in a given subset of the vertex set of the tree are restricted to be successive on the spine. A linear time algorithm is also provided.
0 references
tree
0 references
embedding
0 references
linear time algorithm
0 references
