Doubling convex sets in lattices: Characterizations and recognition algorithms

DOI10.1023/A:1016524118566zbMath1010.06009OpenAlexW76773566MaRDI QIDQ698449

Nathalie Caspard, Karell Bertet

Publication date: 18 September 2002

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016524118566

zbMATH Keywords

posetconvex setsrecognition algorithmdoublingarrow relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices (06B99)

Related Items (2)

AN OVERVIEW OF Λ-TYPE OPERATIONS ON QUASI-SYMMETRIC FUNCTIONS ⋮ Enumerating maximal consistent closed sets in closure systems

This page was built for publication: Doubling convex sets in lattices: Characterizations and recognition algorithms