An algorithmic proof that semiorders are representable
From MaRDI portal
Publication:3990620
DOI10.1016/0196-6774(92)90010-AzbMath0766.06001OpenAlexW1996944372MaRDI QIDQ3990620
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(92)90010-a
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
This page was built for publication: An algorithmic proof that semiorders are representable