Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199608)28:1<15::AID-NET3>3.0.CO;2-G" /><15::AID-NET3>3.0.CO;2-G 10.1002/(SICI)1097-0037(199608)28:1<15::AID-NET3>3.0.CO;2-GzbMath0865.90061OpenAlexW1993489705MaRDI QIDQ5689814

No author found.

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199608)28:1<15::aid-net3>3.0.co;2-g

zbMATH Keywords

maximum independent setscircular-arc graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

Powers of geometric intersection graphs and dispersion algorithms

This page was built for publication: Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs