scientific article; zbMATH DE number 3993569
From MaRDI portal
Publication:4722060
zbMath0614.03043MaRDI QIDQ4722060
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Permutations, words, matrices (05A05) Total orders (06A05) Theory of numerations, effectively presented structures (03D45)
Related Items (15)
A subexponential upper bound for the on-line chain partitioning problem ⋮ On-line algorithms for ordered sets and comparability graphs ⋮ On-line algorithms for orders ⋮ On-line chain partitions of orders ⋮ Improved lower bound on the on-line chain partitioning of semi-orders with representation ⋮ Improved lower bounds on the on-line chain partitioning of posets of bounded dimension ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ Lower bounds for randomized algorithms for online chain partitioning ⋮ On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains ⋮ Colorful induced subgraphs ⋮ The online graph bandwidth problem ⋮ An easy subexponential bound for online chain partitioning ⋮ Unnamed Item ⋮ A Dichotomy Theorem for First-Fit Chain Partitions ⋮ On-line chain partitions of orders: a survey
This page was built for publication:
