Searching in 2-dimensional partial orders

DOI10.1016/0196-6774(87)90029-0zbMath0642.68120OpenAlexW2069631093MaRDI QIDQ3783596

George Steiner

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90029-0

zbMATH Keywords

polynomial timesearching2-dimensional posets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (5)

On complexity of maximizatin of submodular functions^* ⋮ Understanding the generalized median stable matchings ⋮ Transitive closure for restricted classes of partial orders ⋮ Cross-series-parallel digraphs ⋮ On Generalized Comparison-Based Sorting Problems

This page was built for publication: Searching in 2-dimensional partial orders