Maximum k-chains in planar point sets

DOI10.1145/167088.167136MaRDI QIDQ5248481zbMATH OpenOpenAlexFDO

Authors Stefan Felsner, Lorenz Wernisch

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167136

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Maximum k-chains in planar point sets

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