Testing simultaneous planarity when the common graph is 2-connected (Q3060792)
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: Testing simultaneous planarity when the common graph is 2-connected |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing simultaneous planarity when the common graph is 2-connected |
scientific article |
Statements
Testing Simultaneous Planarity When the Common Graph Is 2-Connected (English)
0 references
9 December 2010
0 references
simultaneous embedding
0 references
planar graph
0 references
PQ tree
0 references
graph drawing
0 references
0.9791848063468932
0 references
0.817443311214447
0 references
0.81660395860672
0 references
0.8106935024261475
0 references
0.8069170117378235
0 references
