Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...