Efficient polynomial algorithms for distributive lattices
From MaRDI portal
Publication:810071
DOI10.1016/0166-218X(91)90022-OzbMath0733.06007MaRDI QIDQ810071
Publication date: 1991
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
recognition; generation; transitive closure; orientability; canonical decomposition; combinatorial algorithm; breadth-first search; polynomial problems; Hasse graph of a distributive lattice
68Q25: Analysis of algorithms and problem complexity
68R05: Combinatorics in computer science
06D99: Distributive lattices
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