Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms

DOI10.1137/S0097539794266171zbMath0914.68101MaRDI QIDQ4210143

Stefan Felsner, Lorenz Wernisch

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

ordersalgorithmschainsYoung tableauxantichainsskeletonspoint sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Longest increasing subsequences in windows based on canonical antichain partition ⋮ Interlacing and scaling exponents for the geodesic watermelon in last passage percolation ⋮ Numerical schemes and rates of convergence for the Hamilton-Jacobi equation continuum limit of nondominated sorting ⋮ Anomaly Detection and Classification for Streaming Data using PDEs ⋮ Approximating the minimum clique cover and other hard problems in subtree filament graphs

This page was built for publication: Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms