Finding a maximum set of independent chords in a circle

DOI10.1016/0020-0190(92)90262-TzbMath0743.68127OpenAlexW2092926123MaRDI QIDQ1186584

S. Singh

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90262-t

zbMATH Keywords

combinatorial problemscomputational geometrymaximum independent setpolygon decompositioncircle graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

The maximum clique problem

Cites Work

• On decomposing polygons into uniformly monotone parts
• Orientations of circle graphs
• Algorithms for a maximum clique and a maximum independent set of a circle graph

This page was built for publication: Finding a maximum set of independent chords in a circle