Bipartite Drawing with Minimum Edge Crossings of Binary Trees and 3-Cayley Trees.
In this paper, we present a simple algorithm for bipartite drawing with minimum edge crossings of binary trees that has a running time of O(n). Together with the drawing, the algorithm also computes the bipartite crossing numbers of binary trees using the same amount of time. The algorithm for binar...
| Vydáno v: | Philippine Computing Journal 2, 1 (2007). |
|---|---|
| Hlavní autor: | |
| Médium: | Článek |
| Jazyk: | English |
| Témata: |