Sciweavers

SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 3 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
DAM
2008
68views more  DAM 2008»
13 years 3 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
COR
2008
118views more  COR 2008»
13 years 3 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
MICAI
2005
Springer
13 years 9 months ago
A Comparison of Memetic Recombination Operators for the MinLA Problem
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...