Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
From MaRDI portal
Publication:4210143
Recommendations
- k-Sets of Convex Inclusion Chains of Planar Point Sets
- On maximum area polygons in a planar point set
- COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE
- Computing the all-pairs longest chains in the plane
- An algorithmic approach to maximal unions of chains in a partially ordered set
- Maximum planar sets that determine k distances
- Extremal polygonal chains on k-matchings
- Planar point sets with large minimum convex decompositions
- An algorithm for maximum common subgraph of planar triangulation graphs
- The Maximum Independent Set Problem in Planar Graphs
Cited in
(12)- COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE
- Computing the all-pairs longest chains in the plane
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
- An Optimal Algorithm for the Maximum Two-Chain Problem
- Interlacing and scaling exponents for the geodesic watermelon in last passage percolation
- Longest increasing subsequences in windows based on canonical antichain partition
- Numerical schemes and rates of convergence for the Hamilton-Jacobi equation continuum limit of nondominated sorting
- scientific article; zbMATH DE number 905031 (Why is no real title available?)
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Anomaly Detection and Classification for Streaming Data using PDEs
- An Optimal Algorithm for the Maximum Three-Chain Problem
This page was built for publication: Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210143)
