Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
Year of publication: |
April-June 2016
|
---|---|
Authors: | Quilliot, Alain ; Rebaine, Djamal |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 2, p. 315-325
|
Subject: | Linear ordering | linear time algorithms | divide-and-conquer graphs | directed tree | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
A polynomial algorithm for the max cut problem on graphs without long odd cycles
Grötschel, Martin, (1982)
- More ...
-
Lower and upper bounds for the linear arrangement problem on interval graphs
Quilliot, Alain, (2018)
-
The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
Munier-Kordon, Alix, (2010)
-
Baptiste, Pierre, (2017)
- More ...