Représentation de familles ordonnées d'intervalles et applications

F. Bendali; A. Quilliot

RAIRO - Operations Research - Recherche Opérationnelle (1997)

  • Volume: 31, Issue: 1, page 73-101
  • ISSN: 0399-0559

How to cite

top

Bendali, F., and Quilliot, A.. "Représentation de familles ordonnées d'intervalles et applications." RAIRO - Operations Research - Recherche Opérationnelle 31.1 (1997): 73-101. <http://eudml.org/doc/105142>.

@article{Bendali1997,
author = {Bendali, F., Quilliot, A.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {linear ordering of the vertices; partially ordered hypergraph},
language = {fre},
number = {1},
pages = {73-101},
publisher = {EDP-Sciences},
title = {Représentation de familles ordonnées d'intervalles et applications},
url = {http://eudml.org/doc/105142},
volume = {31},
year = {1997},
}

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
PB - EDP-Sciences
VL - 31
IS - 1
SP - 73
EP - 101
LA - fre
KW - linear ordering of the vertices; partially ordered hypergraph
UR - http://eudml.org/doc/105142
ER -

References

top
  1. 1. J. F. ALLEN, Towards a general theory of action and time, A.I.123, 1984, p. 123-154. Zbl0567.68025
  2. 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. Zbl0549.90054
  3. 3. S. BENZER, On the topology of the genetic fine structure, Proc. Acad. Sci. USA, 1959, 45, p. 1607-1620. 
  4. 4. C. BERGE, Graphes et hypergraphes, Dunod, 1975. Zbl0213.25702MR357173
  5. 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. Zbl0105.17501MR139159
  6. 6. K. S. BOOTH et G. S. LUEKER, Testing for the consecutive one'propety, Journ. Comput Sciences, 1976, 13, p. 35-58. MR433962
  7. 7. P. DUCHET, Problème de représentation et noyaux, Thèse d'Etat, Paris-VI, 1979. 
  8. 8. D. R. FULKERSON et J. R. GROSS, Incidence Matrices and interval graphs, Pacific Journ. Math., 1965, 15, p. 835-855. Zbl0132.21001MR186421
  9. 9. S. P. GHOSH, File organization: the consecutive retrieval property, Comm. ACM, 1975, 9, p. 802-808. Zbl0246.68004
  10. 10. P. GILMORE et A. HOFFMAN, A characterization of compatibility graphs and interval graphs, Can. Journ. Math., 1964, 16, p. 539-548. Zbl0121.26003MR175811
  11. 11. M. GOLUMBIC, Algorithmic graph theory and perfect graphs, Acad. Press N. Y., chap. 5, 1980. Zbl0541.05054MR562306
  12. 12. E. HUNTINGTON, A set of completely independent postulates for cyclic orders, Proc. Nat. Acad. Sciences USA, 1924, 10, p. 630-631. JFM46.0825.03
  13. 13. D. G. KINDALL, Incidence matrices, interval graphs and seriation in archeology, Pacific Journ. Math., 1969, 28, 3, p. 565-570. Zbl0185.03301MR239990
  14. 14. F. LUCCIO et F. P. PREPARATA, Storage for consecutive retrieval, Inform Process Letter, 5, 1976, 3, p. 68-71. Zbl0354.68034MR441036
  15. 15. A. PNUELI, A. LEMPEL et S. EVEN, Transitive of graphs and identification of permutation graphs, Can. Journ. Math., 1971, 23, p. 160-175. Zbl0204.24604MR292717

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.