Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:33, 3 February 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
