Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 243569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-page book embedding of trees under vertex-neighborhood constraints |
scientific article; zbMATH DE number 243569 |
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
0.89765936
0 references
0.8976593
0 references
0.8946868
0 references
0.8848112
0 references
0.88481116
0 references
0.87790793
0 references
0.86945707
0 references
0 references
