scientific article; zbMATH DE number 905031

zbMATH Open0845.06004MaRDI QIDQ4885571FDOQ4885571

Lorenz Wernisch

Publication date: 16 July 1996

Title of this publication is not available (Why is that?)

Recommendations

• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• An efficient algorithm for maxdominance, with applications
• [[:Publication:3348951|Title not available (Why is that?)]]
• The dominance order for permutations
• An Optimal Algorithm for the Maximum Three-Chain Problem

zbMATH Keywords

dualityantichainspartially ordered setskeletonYoung tableauxdominance orderrandom permutationRobinson-Schensted correspondencebox ordersfast algorithms for computing \(k\)-chains of permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)

Cited In (3)

• Trapezoidal chains and antichains
• An Optimal Algorithm for the Maximum Three-Chain Problem
• Direct dominance of points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885571)