Computing on-line the lattice of maximal antichains of posets

DOI10.1007/BF02115811zbMATH Open0814.06004OpenAlexW1978526581MaRDI QIDQ1344242FDOQ1344242

Claude Jard, Guy-Vincent Jourdan, Jean-Xavier Rampon

Publication date: 9 February 1995

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02115811

zbMATH Keywords

on-line algorithmlattice of maximal antichains of a finite posettesting distributed computations

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Time, clocks, and the ordering of events in a distributed system
• Partially Ordered Sets
• Primes, irreducibles and extremal lattices
• Finding all closed sets: A general approach
• The jump number and the lattice of maximal antichains
• The Factorization and Representation of Lattices
• Comments on Ring based termination detection algorithm for distributed computations
• An extended arithmetic
• On-line computations of the ideal lattice of posets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• On-line algorithms for orders
• Title not available (Why is that?)
• On-line computations of the ideal lattice of posets
• Weak-order extensions of an order.
• Efficient optimally lazy algorithms for minimal-interval semantics
• A fast incremental algorithm for building lattices
• Another note on Dilworth's decomposition theorem.
• Enumeration aspects of maximal cliques and bicliques
• Simplicial elimination schemes, extremal lattices and maximal antichain lattices
• A fast algorithm for building lattices

This page was built for publication: Computing on-line the lattice of maximal antichains of posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344242)