Independent Sets in Circular-Arc Graphs

DOI10.1006/jagm.1995.1031zbMath0839.68069OpenAlexW2032853328MaRDI QIDQ4845846

No author found.

Publication date: 28 May 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1031

zbMATH Keywords

linear time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection ⋮ Temporal interval cliques and independent sets ⋮ A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs ⋮ Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals

This page was built for publication: Independent Sets in Circular-Arc Graphs