Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simpler algorithms for testing two-page book embedding of partitioned graphs |
scientific article; zbMATH DE number 6868606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simpler algorithms for testing two-page book embedding of partitioned graphs |
scientific article; zbMATH DE number 6868606 |
Statements
Simpler algorithms for testing two-page book embedding of partitioned graphs (English)
0 references
15 May 2018
0 references
book embedding
0 references
planar graph
0 references
2-page book embedding
0 references
clustered planarity
0 references
0 references
0.99999994
0 references
0 references
0.88481116
0 references
0.8668764
0 references
0.8643438
0 references
0.86434364
0 references
0.85642296
0 references
0.85268545
0 references
0.84769285
0 references
