Sciweavers

379 search results - page 4 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
WABI
2004
Springer
14 years 26 days ago
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
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...
Behshad Behzadi, Jean-Marc Steyaert
TAMC
2010
Springer
13 years 5 months ago
Revisiting the Minimum Breakpoint Linearization Problem
Laurent Bulteau, Guillaume Fertin, Irena Rusu
GD
2003
Springer
14 years 22 days ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
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 ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann