An Optimal Algorithm for the Maximum Two-Chain Problem

DOI10.1137/0405022zbMath0762.68032OpenAlexW2006001074MaRDI QIDQ4012450

No author found.

Publication date: 27 September 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405022

zbMATH Keywords

lower boundpoint dominancedominance hullmax two-chain

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) Data structures (68P05)

Related Items

Single step searching in weighted block graphs ⋮ A sequential algorithm for finding a maximum weightK-independent set on interval graphs ⋮ An efficient algorithm for finding a maximum weight 2-independent set on interval graphs ⋮ Maximum \(k\)-covering of weighted transitive graphs with applications ⋮ Circular permutation graph family with applications ⋮ Maximum weightk-independent set problem on permutation graphs