A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976)
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: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system |
scientific article; zbMATH DE number 6244604
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system |
scientific article; zbMATH DE number 6244604 |
Statements
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (English)
0 references
13 January 2014
0 references
1-planar graphs
0 references
1-planarity testing
0 references
maximal 1-planar graphs
0 references
1-planar embedding
0 references
0.98725545
0 references
0 references
0 references
0 references
0.8921027
0 references
0 references
0.89077914
0 references
0.8904472
0 references
0.8858594
0 references
0.88228977
0 references
