Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés

DOI10.1016/0166-218X(85)90026-5zbMath0589.06004OpenAlexW2033624593MaRDI QIDQ1073816

Jean-Paul Bordat

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90026-5

zbMATH Keywords

complexityalgorithmsfinite posetsHasse diagramlower semi-modularityupper semi- modularity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Paths and cycles (05C38) Semimodular lattices, geometric lattices (06C10)

Related Items (2)

Complexité de problèmes liés aux graphes sans circuit ⋮ Efficient polynomial algorithms for distributive lattices

Cites Work

• Application of the join-irreducible excess function to semi-modular lattices
• Gaussian elimination is not optimal
• Space-Efficient Implementations of Graph Search Methods
• Complexité de problèmes liés aux graphes sans circuit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés