|
|||||
|
|
ContributionsTree-visibility orders |
|
| Authors: | Dieter Kratsch and Jean-Xavier Rampon |
| Institution: | a F.-Schiller-Universität, Fakultät für Mathematik und Informatik, 07740, Jena, Germany b IRCyN (UMR CNRS 6597)/ECN, 1 rue de la Noé, B.P. 92101, F44321, Nantes Cedex 3, France |
| Abstract: | We introduce a new class of partially ordered sets, called tree-visibility orders, containing interval orders, duals of generalized interval orders and height one orders. We give a characterization of tree-visibility orders by an infinite family of minimal forbidden suborders. Furthermore, we present an efficient recognition algorithm for tree-visibility orders. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |