DAGmaps and \(\varepsilon \)-visibility representations for DAGs: algorithms and characterizations (Q3143744)
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 6112211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DAGmaps and \(\varepsilon \)-visibility representations for DAGs: algorithms and characterizations |
scientific article; zbMATH DE number 6112211 |
Statements
DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations (English)
0 references
4 December 2012
0 references
treemaps
0 references
graph drawing
0 references
visibility representations, planar \(st\)-graphs
0 references
directed acyclic graph (DAG)
0 references
0.9926179051399232
0 references
0.7712440490722656
0 references
0.743596076965332
0 references
0.7134771943092346
0 references
