Efficient polynomial algorithms for distributive lattices
type: Item
instance of: scholarly article
title: Efficient polynomial algorithms for distributive lattices
zbMATH Open document ID: 0733.06007
DOI: 10.1016/0166-218X(91)90022-O
author: Jean-Paul Bordat
published in: Discrete Applied Mathematics
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 06D99
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4212121
zbMATH Keywords: breadth-first search
zbMATH Keywords: Hasse graph of a distributive lattice
zbMATH Keywords: polynomial problems
zbMATH Keywords: canonical decomposition
zbMATH Keywords: transitive closure
zbMATH Keywords: generation
zbMATH Keywords: recognition
zbMATH Keywords: orientability
zbMATH Keywords: combinatorial algorithm
MaRDI profile type: Publication
cites work: Q4065051
cites work: Q5685119
cites work: Q5615282
cites work: Q3952144
cites work: Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
cites work: Complexité de problèmes liés aux graphes sans circuit
cites work: Chordal bipartite graphs and crowns
cites work: Graphs Orientable as Distributive Lattices
cites work: Q4195940
cites work: Q4165427
cites work: N-free posets as generalizations of series-parallel posets
cites work: On some complexity properties of N-free posets and posets with bounded decomposition diameter
cites work: Q4101868
cites work: Diamètre de graphes et qualité de service d'un réseau de données
cites work: Complexity of diagrams
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Space-Efficient Implementations of Graph Search Methods
full work available at URL: 0166-218x(91)90022-o
OpenAlex ID: W2092352805
description: scientific article; zbMATH DE number 4212121