Représentation de familles ordonnées d'intervalles et applications
RAIRO - Operations Research - Recherche Opérationnelle, Tome 31 (1997) no. 1, pp. 73-101.
@article{RO_1997__31_1_73_0,
     author = {Bendali, F. and Quilliot, A.},
     title = {Repr\'esentation de familles ordonn\'ees d'intervalles et applications},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {73--101},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {1},
     year = {1997},
     zbl = {0881.90117},
     mrnumber = {1436183},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1997__31_1_73_0/}
}
TY  - JOUR
AU  - Bendali, F.
AU  - Quilliot, A.
TI  - Représentation de familles ordonnées d'intervalles et applications
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1997
DA  - 1997///
SP  - 73
EP  - 101
VL  - 31
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1997__31_1_73_0/
UR  - https://zbmath.org/?q=an%3A0881.90117
UR  - https://www.ams.org/mathscinet-getitem?mr=1436183
LA  - fr
ID  - RO_1997__31_1_73_0
ER  - 
Bendali, F.; Quilliot, A. Représentation de familles ordonnées d'intervalles et applications. RAIRO - Operations Research - Recherche Opérationnelle, Tome 31 (1997) no. 1, pp. 73-101. http://archive.numdam.org/item/RO_1997__31_1_73_0/

1. J. F. Allen, Towards a general theory of action and time, A.I.123, 1984, p. 123-154. | Zbl 0567.68025

2. P. Baptiste et S. Favrel, Résolution de problèmes d'ordonnancements par treillis de Galois et graphes d'intervalles, RAIRO Automatique 18, 4, 1984. | Zbl 0549.90054

3. S. Benzer, On the topology of the genetic fine structure, Proc. Acad. Sci. USA, 1959, 45, p. 1607-1620.

4. C. Berge, Graphes et hypergraphes, Dunod, 1975. | MR 357173 | Zbl 0213.25702

5. J. C. Boland et G. G. Lekkerkeker, Representation of a finite graph by a set of intervais of a line, Fund. Math., 1962, 51, p. 45-64. | MR 139159 | Zbl 0105.17501

6. K. S. Booth et G. S. Lueker, Testing for the consecutive one'propety, Journ. Comput Sciences, 1976, 13, p. 35-58. | MR 433962

7. P. Duchet, Problème de représentation et noyaux, Thèse d'Etat, Paris-VI, 1979.

8. D. R. Fulkerson et J. R. Gross, Incidence Matrices and interval graphs, Pacific Journ. Math., 1965, 15, p. 835-855. | MR 186421 | Zbl 0132.21001

9. S. P. Ghosh, File organization: the consecutive retrieval property, Comm. ACM, 1975, 9, p. 802-808. | Zbl 0246.68004

10. P. Gilmore et A. Hoffman, A characterization of compatibility graphs and interval graphs, Can. Journ. Math., 1964, 16, p. 539-548. | MR 175811 | Zbl 0121.26003

11. M. Golumbic, Algorithmic graph theory and perfect graphs, Acad. Press N. Y., chap. 5, 1980. | MR 562306 | Zbl 0541.05054

12. E. Huntington, A set of completely independent postulates for cyclic orders, Proc. Nat. Acad. Sciences USA, 1924, 10, p. 630-631. | JFM 46.0825.03

13. D. G. Kindall, Incidence matrices, interval graphs and seriation in archeology, Pacific Journ. Math., 1969, 28, 3, p. 565-570. | MR 239990 | Zbl 0185.03301

14. F. Luccio et F. P. Preparata, Storage for consecutive retrieval, Inform Process Letter, 5, 1976, 3, p. 68-71. | MR 441036 | Zbl 0354.68034

15. A. Pnueli, A. Lempel et S. Even, Transitive of graphs and identification of permutation graphs, Can. Journ. Math., 1971, 23, p. 160-175. | MR 292717 | Zbl 0204.24604