On the complexity of interval orders and semiorders

DOI10.1016/0012-365X(87)90003-3zbMath0612.68041MaRDI QIDQ1088407

Ulrich Faigle, György Turán

Publication date: 1987

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

zbMATH Keywords

computational complexityidentification probleminterval ordersemiorderrecognition complexityoptimal identification algorithmorder recognition problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Searching and sorting (68P10)

Related Items (2)

The communication complexity of interval orders ⋮ Maximal sublattices of finite distributive lattices

Cites Work

• Measurement Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of interval orders and semiorders