On-line algorithms for orders

Theoretical Computer Science

Volumn 175, Issue 2, 1997, Pages 225-238

  Bouchitté, Vincent ^a   Rampon, Jean Xavier ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS;

ONLINE ALGORITHMS;

ALGORITHMS;

EID: 0346046194     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00200-4     Document Type: Article

References (30)

1. F. Avitabile, Reconnaissance à la volée des ordres série-parallèles, Master Thesis, LIP ENS Lyon, France, 1995.
2. M. Barbut, Note sur l'algèbre des techniques d'analyse hiérarchique, Appendice du livre de B. Matalon: L'analyse hiérarchique (Gautier-Villars, Paris, 1965).
3. K.P. Bogart, Intervals and orders: what comes after interval orders?, in: Proc. Internat. Workshop on Orders and Algorithms ORDAL'94, Lecture Notes in Computer Science, Vol. 831 (Springer, Berlin, 1994) 13-32.
4. J.P. Bordat, Calcul des idéaux d'un ordonné fini, Recherche opérationnelle/Oper. Res. 25 (1991) 265-275.
5. V. Bouchitté, R. Jégou and J.-X. Rampon, On-line recognition of interval orders, IRISA Research Report No. 751, 1993.
6. D.G. Corneil, Y. Perl and L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
7. R.J. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl. 10 (1965) 149-162.
8. S. Felsner, Interval orders: combinatorial structure and algorithms, Ph.D. Thesis, Technischen Universität Berlin, Germany, 1992.
9. C.J. Fidge, Timestamps in message passing systems that preserve the partial ordering, in: Proc. 11th Australian Computer Science Conf., (1988) 55-66.
10. P.C. Fishburn, Interval Orders and Interval Graphs (Wiley, New York, 1985).
11. H.N. Gabow, A linear time recognition algorithm for interval dags, Inform. Process. Lett. 12 (1981) 20-22.
12. R. Garbe, Algorithmic aspects of interval orders, Ph.D. Thesis, University of Twente, The Netherlands, 1994.
13. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (New York, 1980).
14. M. Habib, M. Morvan, M. Pouzet and J.-X. Rampon, Extensions intervallaires minimales, C. R. Acad. Sci. Paris, t. 313, Série I (1991) 893-898.
15. M. Habib and L. Nourine, On some tree representation of distributive lattices, Research Report No. 93-042, LIRMM Montpellier, France, 1993.
16. F. Harary and R. Norman, Some properties of line digraphs, Rend. del Circolo Math. Parlermo 9 (1960) 149-163.
17. C. Jard, G.-V. Jourdan and J.-X. Rampon, On-line computations of the ideal lattice of posets, Informatique théorique et Applications / Theoret. Inform. Appl. 29 (1995) 227-244.
18. G.-V. Jourdan, J.-X. Rampon and C. Jard, Computing on-line the lattice of maximal antichains of posets, Order 11 (1994) 197-210.
19. H.A. Kierstead, An Effective Version of Dilworth's Theorem, Trans. Amer. Math. Soc. 268 (1981).
20. H.A. Kierstead, Recursive ordered sets, Contemporary Mathematics 57 (1986).
21. L. Lamport, Time, clocks and the ordering of events in a distributed system, Comm. ACM 21 (1978) 558-565.
22. F. Mattern, Virtual time and global states of distributed systems, in: Proc. Internat. Workshop on Parallel and Distributed Algorithms (North-Holland, Amsterdam, 1989) 215-226.
23. R. Medina, Arborescence des états globaux et analyse d'exécutions distribuées, Thèse de l'Université de Montpellier II, France, 1995.
24. J. Mitas, The structure of interval orders, Ph.D. Thesis, Technischen Hochschule Darmstadt, Germany, 1992.
25. M. Morvan and L. Nourine, Generating minimal interval extensions, Research Report No. 92-015, LIRMM Montpellier, France, 1992.
26. K. Reuter, The jump number and the lattice of maximal antichains, Discrete Math. 88 (1991) 289-307.
27. I. Todinca, Algorithmes à la volée pour la reconnaissance de certaines classes de treillis, Master Thesis, LIP ENS Lyon, France, 1996.
28. W.T. Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory (John Hopkins University Press, Baltimore, MD, 1992).
29. J. Valdes, R.E. Tarjan and E.L. Lawler, The recognition of series parallel digraphs, SIAM J. Comput. 11 (1982) 298-313.
30. N. Wiener, A contribution to the theory of relative position, Proc. Cambridge Philos. Soc. 17 (1914) 441-449.