Michel Habib, Lhouari Nourine  Home/Search
Context
Related
| lirmm.fr/~nourine/...istrecognition.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lirmm.fr/~nourine/pub.frametop (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper studies some algorithmic problems on distributive lattices. We use a partition theorem of distributive lattices to obtain linear time-complexity algorithms (Theorems 3 and 4) for recognizing and computing the transitive closure of graphs whose transitive closure is a distributive lattice. As a by-product we obtain a new algorithm for building the lattice of ideals of a given partial order. These results show in that example of distributive lattices that ecient algorithms are... (Update)
Active bibliography (related documents): More All
0.7: Representation of an Order as Union of Interval Orders - Capelle (1994) (Correct)
0.4: Efficient Type Inclusion Tests - Vitek, Horspool, Krall (1997) (Correct)
0.3: String Realizers of Posets with Applications to Distributed .. - Garg, Skawratananond (2001) (Correct)
Similar documents based on text: More All
0.6: Linear Space Algorithm for On-line Detection of Global.. - Jegou, Medina, al. (1995) (Correct)
0.6: Embedding Partially Ordered Sets into Chain-Products - Habib, Huchard, Nourine (1995) (Correct)
0.5: Lazy Completion of a Partial Order to the Smallest Lattice - Bertet, Morvan, Nourine (1997) (Correct)
BibTeX entry: (Update)
@misc{ habib-linear,
author = "Michel Habib and Lhouari Nourine",
title = "Linear Time Recognition Algorithm for Distributive Lattices",
url = "citeseer.ist.psu.edu/habib98linear.html" }
Citations (may not include all citations):509 Introduction to lattices and orders (context) - Davey, Priestley - 1991
352 Virtual time and global states of distributed systems - Mattern - 1989
152 Restructuring lattice theory: An approach based on hierarchi.. (context) - Wille - 1982
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
45 American Mathematical Society (context) - Birkho, Theory et al. - 1967
12 Tree structure for distributive lattices and its application.. (context) - Habib, Nourine - 1996 ACM DBLP
5 the calculation of transitive reduction-closure of orders (context) - Habib, Morvan et al. - 1993
3 Ecient handling of multiple inheritance hierarchies (context) - Caseau - 1993
3 irreducibles and extremal lattices (context) - Markowsky - 1992
3 Subdirect product construction of concept lattices (context) - Wille - 1983
2 Transitive closure for restricted classes of partial orders (context) - Ma, spinrad - 1991
1 Dual symmetry of projective sets in nite modular lattice (context) - Avann - 1958
1 Fast recognition of rings and lattices (context) - Goralcik, Goralcikova et al. - 1981 ACM DBLP
1 Sur la distributivite du treillis des anticha ^nes maximal.. (context) - Morvan, Nourine - 1993
1 ACM Transactions on Programming Langages and Systems (context) - t-Kaci, Boyer et al. - 1989
1 es algorithmique des treillis (context) - Nourine, et - 1993
1 Mesures de la Concurrence et du Parallelisme des Calculs R.. (context) - Charron-Bost - 1989
1 Calcul des ideaux d'un ordonne ni (context) - Bordat - 1991
Documents on the same site (http://www.lirmm.fr/~nourine/pub.frametop.html): More
Embedding Partially Ordered Sets into Chain-Products - Habib, Huchard, Nourine (1995) (Correct)
Lazy Completion of a Partial Order to the Smallest Lattice - Bertet, Morvan, Nourine (1997) (Correct)
Linear Space Algorithm for On-line Detection of Global.. - Jegou, Medina, al. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC