379 search results - page 4 / 76 » The Graham-Knowlton Problem Revisited |
71
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
135
Voted
WABI
2004
Springer
15 years 9 months ago
2004
Springer
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...
96
Voted
JDA
2010
15 years 2 months ago
2010
129
Voted
TAMC
2010
Springer
15 years 1 months ago
2010
Springer
113
Voted
GD
2003
Springer
15 years 8 months ago
2003
Springer
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 ...