Drawing (complete) binary tanglegrams (Q2428677)
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 6028433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Drawing (complete) binary tanglegrams |
scientific article; zbMATH DE number 6028433 |
Statements
Drawing (complete) binary tanglegrams (English)
0 references
26 April 2012
0 references
binary tanglegram
0 references
crossing minimization
0 references
NP-hardness
0 references
approximation algorithm
0 references
fixed-parameter tractability
0 references
0 references
0.9851350784301758
0 references
0.935116171836853
0 references
0.9141000509262084
0 references
0.8574102520942688
0 references
