On \(k\)-weak orders: Recognition and a tolerance result

DOI10.1016/S0012-365X(97)00038-1zbMath0895.06001MaRDI QIDQ1381859

Ann N. Trenk

Publication date: 1 June 1998

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

zbMATH Keywords

polynomial time algorithm\(k\)-leveling function\(k\)-weak posetsbitolerance posets

Mathematics Subject Classification ID

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

Related Items (10)

The \(t\)-discrepancy of a poset ⋮ The fractional weak discrepancy of $(M, 2)$-free posets ⋮ The fractional weak discrepancy of a partially ordered set ⋮ Fractional weak discrepancy and split semiorders ⋮ Forbidden subposets for fractional weak discrepancy at most \(k\) ⋮ Ordered sets with interval representation and \((m,n)\)-Ferrers relation ⋮ Range of the fractional weak discrepancy function ⋮ Fractional weak discrepancy and interval orders ⋮ Tolerance orders of open and closed unit intervals ⋮ Split semiorders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tolerance graphs
• Bipartite tolerance orders
• Tolerance orders and bipartite unit tolerance graphs
• Proper and unit tolerance graphs
• A recognition algorithm for orders of interval dimension two
• Foundational aspects of theories of measurement
• General results on tolerance intersection graphs
• On the Weakness of an Ordered Set

This page was built for publication: On \(k\)-weak orders: Recognition and a tolerance result