Abstract
We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half the on principle smallest number given by the bisection bound for grids without diagonals.
Cite
CITATION STYLE
Kunde, M., Niedermeier, R., & Rossmanith, P. (1994). Faster sorting and routing on grids with diagonals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 225–236). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_144
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
