Efficient polynomial algorithms for distributive lattices

DOI10.1016/0166-218X(91)90022-OMaRDI QIDQ810071zbMATH OpenOpenAlexFDO

Authors Jean-Paul Bordat

Publication date 1991

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(91)90022-o

zbMATH Keywords

breadth-first searchgenerationrecognitiontransitive closurecombinatorial algorithmcanonical decompositionorientabilitypolynomial problemsHasse graph of a distributive lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Distributive lattices (06D99)

Recommendations

• Efficient algorithms on distributive lattices
• Distributive lattice polymorphisms on reflexive graphs
• Tree structure for distributive lattices and its applications
• scientific article; zbMATH DE number 1554940
• The structure of finite distributive lattices.

Cites work

• scientific article; zbMATH DE number 3771666 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3523621 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 3635493 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• Chordal bipartite graphs and crowns
• Complexity of diagrams
• Complexité de problèmes liés aux graphes sans circuit
• Depth-First Search and Linear Graph Algorithms
• Diamètre de graphes et qualité de service d'un réseau de données
• Graphs Orientable as Distributive Lattices
• N-free posets as generalizations of series-parallel posets
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
• Space-Efficient Implementations of Graph Search Methods

Cited in

(4)

• Distributive lattice polymorphisms on reflexive graphs
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
• Efficient algorithms on distributive lattices
• Time and space efficient representations of distributive lattices

This page was built for publication: Efficient polynomial algorithms for distributive lattices

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