Representing point sets on the plane as permutations

DOI10.1016/J.IPL.2021.106228OpenAlexW3214741668MaRDI QIDQ2059910FDOQ2059910

Authors: Yanyan Li 

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106228

Recommendations

• Publication:4724636
• On the heaviest increasing or decreasing subsequence of a permutation, and paths and matchings on weighted point sets
• Generating permutations with given ups and downs
• scientific article; zbMATH DE number 3880704
• scientific article; zbMATH DE number 2038722

zbMATH Keywords

permutationspartial orderscryptographypoint setsencodings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Algorithmic graph theory and perfect graphs
• Title not available (Why is that?)
• On computing the length of longest increasing subsequences
• A decomposition theorem for partially ordered sets
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Representing point sets on the plane as permutations

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