Efficient polynomial algorithms for distributive lattices

DOI10.1016/0166-218X(91)90022-OzbMATH Open0733.06007OpenAlexW2092352805MaRDI QIDQ810071FDOQ810071

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

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.

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)

Cites Work

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

Cited In (2)

• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
• Efficient algorithms on 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)