A recognition algorithm for orders of interval dimension two
type: Item
instance of: scholarly article
title: A recognition algorithm for orders of interval dimension two
zbMATH Open document ID: 0823.06003
DOI: 10.1016/0166-218X(94)00056-J
author: Larry J. Langley
published in: Discrete Applied Mathematics
publication date: 1995-10-31T00:00:00Z
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 777829
zbMATH Keywords: partially ordered set
zbMATH Keywords: interval dimension
zbMATH Keywords: dimension
zbMATH Keywords: algorithm
zbMATH Keywords: interval realizer
MaRDI profile type: Publication
cites work: An obvious proof of Fishburn's interval order theorem
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Trapezoid graphs and their coloring
cites work: Partially Ordered Sets
cites work: Betweenness, orders and interval graphs
cites work: Q3328583
cites work: Interval dimension is a comparability invariant
cites work: An upper bound on the ''dimension of interval orders''
cites work: Q3670598
cites work: Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
cites work: On the complexity of posets
cites work: Characterization problems for graphs, partially ordered sets, lattices, and families of sets
cites work: Q4918385
cites work: The Complexity of the Partial Order Dimension Problem
description: scientific article; zbMATH DE number 777829