Finding all maximal subsequences with hereditary properties

DOI10.4230/LIPICS.SOCG.2015.240MaRDI QIDQ5368691zbMATH OpenOpenAlexFDO

Authors Drago Bokal, S. Cabello, David Eppstein

Publication date 10 October 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2015/5113/pdf/30.pdf

zbMATH Keywords

convex hulldiametertrajectorymonotone pathsequence of points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• A linear time algorithm for finding maximal planar subgraphs
• A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
• A linear algorithm for the maximal planar subgraph problem
• Partitioning a sequence into few monotone subsequences
• A new approach to the dynamic maintenance of maximal points in a plane

Cited in

(4)

• Two approaches to building time-windowed geometric data structures
• Window queries for intersecting objects, maximal points and approximations using coresets
• Time windowed data structures for graphs
• The Most Likely Object to be Seen Through a Window

This page was built for publication: Finding all maximal subsequences with hereditary properties

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