Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526): Difference between revisions
From MaRDI portal
Latest revision as of 18:21, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for clique-independent sets on subclasses of circular-arc graphs |
scientific article |
Statements
Algorithms for clique-independent sets on subclasses of circular-arc graphs (English)
0 references
17 August 2006
0 references
Helly circular-arc graphs
0 references
0 references