Efficient polynomial algorithms for distributive lattices

DOI10.1016/0166-218X(91)90022-OzbMath0733.06007OpenAlexW2092352805MaRDI QIDQ810071

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

recognitiongenerationtransitive closureorientabilitycanonical decompositioncombinatorial algorithmbreadth-first searchpolynomial 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• N-free posets as generalizations of series-parallel posets
• Complexity of diagrams
• Space-Efficient Implementations of Graph Search Methods
• Diamètre de graphes et qualité de service d'un réseau de données
• Graphs Orientable as Distributive Lattices
• Complexité de problèmes liés aux graphes sans circuit
• Depth-First Search and Linear Graph Algorithms

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