Efficient algorithms on distributive lattices

Discrete Applied Mathematics

Volumn 110, Issue 2-3, 2001, Pages 169-187

  Habib, Michel ^a   Medina, Raoul ^a   Nourine, Lhouari ^a   Steiner, George ^b  

^a LIRMM   (France)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

05C45; 06A05; 06A06; Combinatorial code; Ideal lattice; Poset

Indexed keywords

EID: 0035877362     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00258-4     Document Type: Article

References (20)

1. Birkhoff G. Lattice Theory, Coll. Publ. XXV, Vol. 25. 3rd Edition:1967;American Mathematical Society, Providence, RF.
2. Bonnet R., Pouzet M. Extensions et stratifications d'ensembles dispersés. C.R. Acad. Sci. Sér. A. 268:1969;1512-1515.
3. Bordat J.P. Calcul des idéaux d'un ordonné fini. Rech, Opér. / Oper. Res. 25(4):1991;265-275.
4. R. Cooper, K. Marzullo, Consistent detection of global predicates, Proceedings ACM / ONR Workshop on Parallel and Distributed Debugging, Santa Cruz, California, May 1991, pp. 163-173.
5. Diehl C., Jard C., Rampon J.-X. Computing on-line the covering graph of the ideal lattice of posets, Technical Report. February 1993;IRISA, Rennes, France.
6. C. Diehl, C. Jard, JX Rampon, Reachability analysis on distributed executions, in: Jouannaud Gaudel (Ed.), TAPSOFT, Lecture Notes in Computer Science, Vol. 688, Orsay, Springer, Berlin, April 1993, pp. 629-643.
7. Ganter B., Reuter K. Finding all closed sets: a general approach. Order. 8:1991;283-290.
8. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New-York.
9. Habib M., Nourine L. Tree structure for distributive lattices and its applications. Theoret. Comput. Sci. 165:1996;391-405.
10. Habib M., Nourine L., Steiner G. Gray codes for the ideals of interval orders. J. Algorithms. 25:1997;52-66.
11. Jégou R., Medina R., Nourine L. Linear space algorithm for on-line detection of global predicates. Desel J. Structures in Concurrency Theory. 1995;175-189 Springer, Berlin.
12. Koda Y., Ruskey F. A gray code for the ideals of a forest poset. J. Algorithms. 15:1993;324-340.
13. Mattern F. Virtual time and global states of distributed systems. Cosnard M.et al. Parallel and Distributed Algorithms. 1989;215-226 Elsevier, North-Holland, Amsterdam.
14. Papadimitriou C., Steiglitz K. Combinatorial Optimization, Algorithms and Complexity. 1982;Prentice-Hall, Englewood Cliffs, NJ.
15. Pruesse G., Ruskey F. Gray codes from antimatroids. Order. 10:1993;239-252.
16. Pruesse G., Ruskey F. Generating linear extensions fast. SIAM J. Comput. 23:1994;373-386.
17. Ruskey F. Listing and counting subtrees of a tree. SIAM. J. Comput. 10:1981;141-150.
18. Savage C. A survey of combinatorial gray codes. SIAM Rev. 39:1997;605-629.
19. M.B. Squire, Enumerating the ideals of a poset, preprint, North Carolina State University, 1995.
20. Steiner G. An algorithm for generating the ideals of a partial order. Oper. Res. Lett. 5:1986;317-320.