Linear discrepancy and bandwidth
From MaRDI portal
Publication:1611292
DOI10.1023/A:1012267732204zbMath1004.06006OpenAlexW51549503MaRDI QIDQ1611292
Paul J. Tanenbaum, Peter C. Fishburn, Ann N. Trenk
Publication date: 21 August 2002
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012267732204
Combinatorics of partially ordered sets (06A07) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
The \(t\)-discrepancy of a poset ⋮ When linear and weak discrepancy are equal ⋮ Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs ⋮ Bandwidth on AT-free graphs ⋮ Irreducible width 2 posets of linear discrepancy \(3\) ⋮ A characterization of partially ordered sets with linear discrepancy equal to \(2\) ⋮ Average relational distance in linear extensions of posets ⋮ The total linear discrepancy of an ordered set ⋮ A characterisation of posets that are nearly antichains ⋮ Linear discrepancy of the product of two chains ⋮ Degree bounds for linear discrepancy of interval orders and disconnected posets ⋮ Hardness and approximation of minimum distortion embeddings ⋮ Bandwidth of Bipartite Permutation Graphs in Polynomial Time ⋮ Bandwidth of bipartite permutation graphs in polynomial time
