Finding a maximum set of independent chords in a circle

DOI10.1016/0020-0190(92)90262-TMaRDI QIDQ1186584zbMATH OpenOpenAlexFDO

Authors 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

computational geometrycombinatorial problemsmaximum independent setcircle graphpolygon decomposition

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1409205
• An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
• A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
• scientific article; zbMATH DE number 4173024
• Finding a maximum-weight convex set in a chordal graph
• On circles containing the maximum number of points
• Counting the number of independent sets in chordal graphs
• Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
• Independent sets and chromatic numbers of circle graphs
• scientific article; zbMATH DE number 3988128

Cites work

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

Cited in

(3)

• An output sensitive algorithm for computing a maximum independent set of a circle graph
• The maximum clique problem
• On decomposing polygons into uniformly monotone parts

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

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