Contains the proceedings of the 1st International Workshop on Orders, Algorithms and Applications, held at Lyon, France, in July 1994. The contributors offer different perspectives on theoretical and applicational aspects of ordered sets and the algorithmic aspects of order theory.This question was resolved by Kloks, Kratsch, and Spinrad . This paper studies the treewidth problem for cocomparability graphs of partial orders of bounded dimension, but does not ... for solving an optimization problem for a special class of graphs will first create the appropriate model, and then work on the model.
|Title||:||Orders, Algorithms and Applications|
|Author||:||Vincent Bouchitte, Michel Morvan|
|Publisher||:||Springer Science & Business Media - 1994-06-23|