Linear discrepancy and bandwidth
From MaRDI portal
Publication:1611292
DOI10.1023/A:1012267732204zbMath1004.06006MaRDI 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
06A07: Combinatorics of partially ordered sets
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Bandwidth of Bipartite Permutation Graphs in Polynomial Time, 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\), Average relational distance in linear extensions of posets, The total linear discrepancy of an ordered set, 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, A characterisation of posets that are nearly antichains, A characterization of partially ordered sets with linear discrepancy equal to \(2\), Linear discrepancy of the product of two chains