A new perspective on clustered planarity as a combinatorial embedding problem (Q897898)
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 new perspective on clustered planarity as a combinatorial embedding problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new perspective on clustered planarity as a combinatorial embedding problem |
scientific article |
Statements
A new perspective on clustered planarity as a combinatorial embedding problem (English)
0 references
8 December 2015
0 references
graph drawing
0 references
clustered planarity
0 references
constrained planar embedding
0 references
characterization
0 references
algorithms
0 references
0 references
0 references
0.91076064
0 references
0.8994552
0 references
0 references
0.8916492
0 references
0.88901454
0 references
0 references
