Computing on-line the lattice of maximal antichains of posets

DOI10.1007/BF02115811zbMath0814.06004MaRDI QIDQ1344242

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 algorithm; lattice of maximal antichains of a finite poset; testing distributed computations

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

06A06: Partial orders, general

Related Items

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

Cites Work

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