Counting edge crossings in a 2-layered drawing (Q2390316)
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 5581175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting edge crossings in a 2-layered drawing |
scientific article; zbMATH DE number 5581175 |
Statements
Counting edge crossings in a 2-layered drawing (English)
0 references
21 July 2009
0 references
graph algorithms
0 references
edge crossings
0 references
bipartite graphs
0 references
counting
0 references
graph drawing
0 references
dynamic programming
0 references
divide-and-conquer
0 references
0 references
0.908791720867157
0 references
0.8329822421073914
0 references
0.8301432132720947
0 references
0.829881489276886
0 references
