Tree-Visibility Orders

Abstract : In this paper we introduce a new class of partially ordered sets, called tree-visibility orders, extending the class of interval orders in a fashion similar to the extension of interval graphs to chordal graphs. This class contains 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 and present an efficient recognition algorithm.
Type de document :
Rapport
[Research Report] RR-2683, INRIA. 1995
Liste complète des métadonnées

https://hal.inria.fr/inria-00074008
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:17:10
Dernière modification le : mercredi 16 mai 2018 - 11:23:04
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:48:18

Fichiers

Identifiants

  • HAL Id : inria-00074008, version 1

Citation

Dieter Kratsch, Jean-Xavier Rampon. Tree-Visibility Orders. [Research Report] RR-2683, INRIA. 1995. 〈inria-00074008〉

Partager

Métriques

Consultations de la notice

141

Téléchargements de fichiers

135